Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory (Extended Version).
Yannick ForsterDominik KirstDominik WehrPublished in: CoRR (2020)
Keyphrases
- first order logic
- expressive power
- set theory
- quantifier free
- propositional logic
- inference rules
- theorem proving
- inductive logic programming
- theorem prover
- probabilistic reasoning
- classical first order logic
- representation language
- transitive closure
- probabilistic graphical models
- markov logic networks
- knowledge representation
- markov networks
- relational algebra
- predicate calculus
- markov logic
- quantifier elimination
- horn clauses
- constraint databases
- proof procedure
- logical rules
- monadic second order logic
- mazurkiewicz traces
- special case
- anti unification
- probability theory
- np hard