𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Gentzen Type Formalizations

✍ Scribed by Anita Wasilewska

Book ID
102487339
Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
298 KB
Volume
26
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

DFC-algorithms for Suszko logic and one-
DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations
✍ Anita Wasilewska πŸ“‚ Article πŸ“… 1984 πŸ› Springer Netherlands 🌐 English βš– 554 KB

We use here the notions and results from algebraic theory of programs in order to give a new proof of the decidability theorem for Suszko logic SCI (Theorem 3). We generalize the method used in the proof of that theorem in order r prove a more general fact that any propositional logic which admits

Gentzen-type formulation of the preposit
Gentzen-type formulation of the prepositional logicLQ
✍ Tsutomu Hosoi πŸ“‚ Article πŸ“… 1988 πŸ› Springer Netherlands 🌐 English βš– 350 KB

We give a Gentzen-type formulation GQ for the intermediate logic LQ and prove the cut-elimination theorem on it, where LQ is the propositional logic obtained from the intuitionistic propositional logic LI by adding the axioms of the form 7 AV 7 7 A.