Computations in fragments of intuitionistic propositional logic

DOI10.1007/BF01880328zbMath0743.03007MaRDI QIDQ1181713

Lex Hendriks, Gerard R. Renardel de Lavalette, Dick H. J. de Jongh

Publication date: 27 June 1992

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

automated reasoning; intuitionistic propositional logic; exact model; fragment; finite diagrams

Mathematics Subject Classification ID

03B35: Mechanization of proofs and logical operations

03B20: Subsystems of classical logic (including intuitionistic logic)

03-04: Software, source code, etc. for problems pertaining to mathematical logic and foundations

Related Items

Algebraic semantics for the ‐fragment of and its properties, Free equivalential algebras, Doing logic by computer: Interpolation in fragments of intuitionistic propositional logic, Free algebras corresponding to multiplicative classical linear logic and some of its extensions, Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic, Algebraic semantics for the (↔, ¬¬)-fragment of IPC

Cites Work

• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Interpolation in fragments of intuitionistic propositional logic
• On formulas of one variable in intuitionistic propositional calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item