We present a new propositional calculus that has desirable natures with respect to both automatic reasoning and computational complexity: we introduce an inference rule, called permutation, into a cut-free Gentzen type propositional calculus. It allows us to obtain a system which (1) guarantees the
β¦ LIBER β¦
A Cut-Free Gentzen Formulation of Basic Propositional Calculus
β Scribed by Kentaro Kikuchi; Katsumi Sasaki
- Book ID
- 110419005
- Publisher
- Springer Netherlands
- Year
- 2003
- Tongue
- English
- Weight
- 97 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0925-8531
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Tractability of cut-free Gentzen type pr
β
Noriko H. Arai
π
Article
π
1996
π
Elsevier Science
π
English
β 902 KB
Tractability of Cut-free Gentzen-type pr
β
Noriko H. Arai
π
Article
π
2000
π
Elsevier Science
π
English
β 114 KB
In Arai (1996), we introduced a new inference rule called permutation to propositional calculus and showed that cut-free Gentzen system LK (GCNF) with permutation (1) satisΓΏes the feasible subformula property, and (2) proves pigeonhole principle and k-equipartition polynomially. In this paper, we su
A Contraction-free and Cut-free Sequent
β
Brian Hill; Francesca Poggiolesi
π
Article
π
2010
π
Springer Netherlands
π
English
β 326 KB
A Gentzen-Type Calculus of Sequents for
β
Riser, John (author)
π
Article
π
1967
π
Cambridge University Press (CUP)
π
English
β 563 KB
A Gentzen-Type Calculus of Sequents for
β
Riser, John (author)
π
Article
π
1967
π
Cambridge University Press (CUP)
π
English
β 563 KB
An extended Gentzen-type formulation of
β
Osamu Morikawa
π
Article
π
1999
π
Elsevier Science
π
English
β 427 KB
The main purpose of this paper is to present an extended Gentzen-type formulation of a many-valued modal propositional logic based on Zadeh's similarity relation.