A Connection-Based Characterization of Bi-intuitionistic Validity

DOI10.1007/978-3-642-22438-6_21zbMath1314.03029OpenAlexW1683126086MaRDI QIDQ5200030

Didier Galmiche, Daniel Méry

Publication date: 29 July 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22438-6_21

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Cut-elimination and normal-form theorems (03F05) Intermediate logics (03B55)

Related Items

A proof-search procedure for intuitionistic propositional logic, Dualized Simple Type Theory, A connection-based characterization of bi-intuitionistic validity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof analysis in modal logic
• A Labelled System for IPL with Variable Splitting
• Deep Inference in Bi-intuitionistic Logic
• Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
• A Formulae-as-Types Interpretation of Subtractive Logic
• Characterizing Provability in BI’s Pointer Logic Through Resource Graphs
• Subtractive logic