Polynomially and Superexponentially Shorter Proofs in Fragments of Logic.
Franco MontagnaPublished in: J. Symb. Log. (1992)
Keyphrases
- natural deduction
- cut elimination
- sequent calculus
- theorem proving
- logic programming
- theorem prover
- automated reasoning
- classical logic
- proof search
- automated theorem proving
- deontic logic
- formal proofs
- equational theories
- multi valued
- modal logic
- special case
- sound and complete axiomatization
- machine learning
- horizontal fragmentation
- linear logic
- truth values
- lower bound