Home
Computational Logic Notes
The interweb
barrywatson.se
Algebra
Barry's Prolog
Clausal form
Completeness
Conjunction
Conjunctive Normal Form (CNF)
Contradiction
Disjunctive Normal Form (DNF)
Davis-Putnam procedure
Davis-Putnam-Logemann-Loveland procedure
Definitional Conjunctive Normal Form
De Morgan's law
Disjunction
Duality
Equivalence
Equivalence relation
Existential quantification
First-order logic
Free variable
Ground expression
Height
Herbrand algebra
Herbrand model
Herbrand universe
Hintikka's lemma
Identity
Implication
Isomorphism
König's lemma
Least number principle
Literal
Logical consequence
Mathematical induction
Metacircular Interpreter (Prolog)
Multisets
Multiset ordering
Negation
Negation Equivalence Normal Form (NENF)
Negation Normal Form (NNF)
Ordering
Ordinal
Prenex Normal Form (PNF)
Propositional logic
Relation
Resolution (propositional)
Sentence
Skolem Form
Soundness
Tableau procedure
Tautology
Theorem
Transitive closure
Trees
Truth assignment
Truth table
Universal quantification
Universe of discourse
Copyright © 2014 — 2016
Barry Watson
. All rights reserved.