Interpolation theorems for intuitionistic predicate logic

DOI10.1016/S0168-0072(01)00060-4zbMath1001.03010OpenAlexW2085625417MaRDI QIDQ5957915

Grigori Mints

Publication date: 11 December 2002

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(01)00060-4

zbMATH Keywords

interpolation theoremintuitionistic logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Interpolation, preservation, definability (03C40) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

Hypersequent calculi for intuitionistic logic with classical atoms ⋮ Towards a clausal analysis of cut-elimination ⋮ Sequent calculi for intuitionistic Gödel-Löb logic ⋮ Proof Search and Counter Model of Positive Minimal Predicate Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolation properties of superintuitionistic logics
• Representing scope in intuitionistic deductions
• Indexed systems of sequents and cut-elimination
• Linear reasoning. A new form of the Herbrand-Gentzen theorem
• A logic program for transforming sequent proofs to natural deduction proofs
• Proof theory