Generalized tableau systems for intermediate propositional logics

DOI10.1007/BFB0027404MaRDI QIDQ4610314zbMATH OpenFDO

Authors Alessandro Avellone, Ugo Moscato, Pierangelo Miglioli, Mario Ornaghi

Publication date 15 January 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0027404

zbMATH Keywords

duplicationsfiltration techniquesintermediate propositional logicstableau systems

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Intermediate logics (03B55)

Recommendations

• scientific article; zbMATH DE number 1612549
• scientific article; zbMATH DE number 3841822
• scientific article; zbMATH DE number 3873298
• Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
• On certain normalizable natural deduction formulations of some propositional intermediate logics

Cites work

• A method to single out maximal propositional logics with the disjunction property. I
• A method to single out maximal propositional logics with the disjunction property. II
• A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property
• A series of successive modifications of Peirce's rule
• An O(n log n)-Space Decision Procedure for Intuitionistic Propositional Logic
• An improved refutation system for intuitionistic predicate logic
• An infinite class of maximal intermediate propositional logics with the disjunction property
• Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic
• Contraction-free sequent calculi for intuitionistic logic
• Counting the maximal intermediate constructive logics
• Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
• scientific article; zbMATH DE number 3300581 (Why is no real title available?)
• scientific article; zbMATH DE number 3074853 (Why is no real title available?)
• Kripke models and intermediate logics
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Semantical investigations in Heyting's intuitionistic logic
• The decidability of the Kreisel-Putnam system
• The simple substitution property of the intermediate propositional logics on finite slices

Cited in

(9)

• SAT-based proof search in intermediate propositional logics
• Labelled tableau systems for some subintuitionistic logics
• scientific article; zbMATH DE number 1612549 (Why is no real title available?)
• Simplification Rules for Intuitionistic Propositional Tableaux
• The tableau method for a logical system based on a finite poset
• Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic
• Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
• BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
• Tableau Systems for Logics of Subinterval Structures over Dense Orderings

This page was built for publication: Generalized tableau systems for intermediate propositional logics

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