Tree-Sequent Methods for Subintuitionistic Predicate Logics

DOI10.1007/978-3-540-73099-6_13MaRDI QIDQ5434487zbMATH OpenOpenAlexFDO

Authors Ryo Ishigaki, Kentaro Kikuchi

Publication date 4 January 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-73099-6_13

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Predicate logical extensions of some subintuitionistic logics
• Subintuitionistic logics with Kripke semantics
• A closer look at some subintuitionistic logics
• A Tree-Sequent Calculus for a Natural Predicate Extension of Visser's Propositional Logic
• scientific article; zbMATH DE number 1953898

Cited in

(12)

• Predicate logical extensions of some subintuitionistic logics
• A closer look at some subintuitionistic logics
• A canonical model for constant domain basic first-order logic
• Subintuitionistic logics with Kripke semantics
• Alternative semantics for Visser's propositional logics
• Tree-sequent calculi and decision procedures for intuitionistic modal logics
• A Tree-Sequent Calculus for a Natural Predicate Extension of Visser's Propositional Logic
• Subintuitionistic logics and their modal companions: a nested approach
• Internal and external calculi: ordering the jungle without being lost in translations
• Taking bi-intuitionistic logic first-order: a proof-theoretic investigation via polytree sequents
• Unifying sequent systems for Gödel-Löb provability logic via syntactic transformations
• Display calculi and other modal calculi: a comparison

This page was built for publication: Tree-Sequent Methods for Subintuitionistic Predicate Logics

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