Course Description: | This course practices symbolic logic based on mathematical fundaments from Boolean functions and logic circuit design including assignments in Prolog language. Topics: historical introduction to logic; formal propositional logic; propositional logic; first order predicate logic; models for first order logic, examples of first order structures, Tarski’s definition of truth, Skolem functions;
non-deterministic finite automaton, graphs, search strategies; PCNF, Herbrand’s theorem, computer science style notation; unifiers, algebraic properties, most general unifiers; double recursion and a simple puzzle game; resolution with unification, soundness; lifting lemma, completeness of first order predicate logic with resolution.
Assessment: homework and class participaiton. |