A semantic proof of strong cut-admissibility for first-order Gödel logic.
Ori LahavArnon AvronPublished in: J. Log. Comput. (2013)
Keyphrases
- classical first order logic
- proof theory
- first order logic
- valued logic
- linear logic
- logic programming
- higher order logic
- conditional logic
- higher order
- natural deduction
- logical rules
- linear temporal logic
- predicate calculus
- theorem proving
- automated reasoning
- theorem prover
- semantic web
- classical logic
- semantic network
- proof theoretic
- high level
- finite model theory
- proof procedure
- semantic similarity
- probabilistic logic
- proof search
- general logic programs
- horn clauses
- term rewriting
- sequent calculus
- sequent calculi
- natural language
- semantic annotation
- domain specific
- computer algebra
- dynamic logic
- automated theorem proving
- multi valued
- cut elimination
- propositional logic
- modal logic
- sound and complete with respect
- semantic information
- logical representation
- truth values
- predicate logic
- decision procedures
- logic programs