scientific article; zbMATH DE number 4143971

MaRDI QIDQ3475264zbMATH OpenFDO

Authors Albert G. Dragalin

Publication date 1987

zbMATH Keywords

cut-elimination theoremclassical higher-order logicintuitionistic metamathematics

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05)

Recommendations

• Completeness and cut-elimination theorems for high-order classical logic. Constructive method
• Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
• Publication:3481700
• Algebraic proofs of cut elimination
• Structural cut elimination. I: Intuitionistic and classical logic

Cited in

(15)

• A note on the complexity of classical and intuitionistic proofs
• The Taming of the Cut. Classical Refutations with Analytic Cut
• A note on cut-elimination for classical propositional logic
• Structural cut elimination. I: Intuitionistic and classical logic
• Explicit algebraic models for constructive and classical theories with non-standard elements
• Cut-elimination and interpolation for \(\Omega\)-logic
• scientific article; zbMATH DE number 6680140 (Why is no real title available?)
• Completeness and cut-elimination theorems for high-order classical logic. Constructive method
• A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
• Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics
• scientific article; zbMATH DE number 4123723 (Why is no real title available?)
• scientific article; zbMATH DE number 4152375 (Why is no real title available?)
• Algebraic proofs of cut elimination
• Cut-Elimination in the Intuitionistic Many-Valued Logic Based on a Partial Order
• Some results on cut-elimination, provable well-orderings, induction and reflection

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3475264)