scientific article; zbMATH DE number 4152375

MaRDI QIDQ3481700zbMATH OpenFDO

Authors Albert G. Dragalin

Publication date 1987

zbMATH Keywords

completeness theoremcut- elimination theorem for intuitionistic second-order sequent calculushigher-order intuitionistic logicmodified Beth modelsecond-order intuitionistic logicstrange worlds

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Cut-elimination and normal-form theorems (03F05) Metamathematics of constructive systems (03F50) Intuitionistic mathematics (03F55)

Recommendations

• An intuitionistic completeness theorem for classical predicate logic
• scientific article; zbMATH DE number 4057508
• scientific article; zbMATH DE number 4035828
• Publication:3475264
• Intuitionistic completeness of first-order logic

Cited in

(15)

• The completeness theorems for some intuitionistic epistemic logics in terms of interval semantics
• Inductively generated formal topologies.
• A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
• Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic
• Explicit algebraic models for constructive and classical theories with non-standard elements
• Completeness and cut-elimination theorems for high-order classical logic. Constructive method
• Lindenbaum's lemma via open induction
• scientific article; zbMATH DE number 4143971 (Why is no real title available?)
• scientific article; zbMATH DE number 4035828 (Why is no real title available?)
• scientific article; zbMATH DE number 4057508 (Why is no real title available?)
• scientific article; zbMATH DE number 32142 (Why is no real title available?)
• Intuitionistic completeness for first order classical logic
• scientific article; zbMATH DE number 4195940 (Why is no real title available?)
• Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
• An intuitionistic completeness theorem for classical predicate logic

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 Q3481700)