A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
Mitsuhiro OkadaPublished in: Theor. Comput. Sci. (2002)
Keyphrases
- cut elimination
- higher order
- sequent calculus
- proof theoretic
- linear logic
- inference rules
- sequent calculi
- modal logic
- natural deduction
- higher order logic
- proof theory
- intuitionistic logic
- wide class
- proof search
- theorem prover
- anti unification
- default reasoning
- sufficient conditions
- natural language
- theorem proving
- logical framework
- classical logic
- semantic web
- linear time temporal logic
- nonmonotonic reasoning
- decision procedures
- logic programming
- markov random field
- default logic
- semantic network
- constraint logic programming
- temporal logic
- fixed point
- expressive power
- first order logic
- object oriented
- pairwise