Deep Inference in Bi-intuitionistic Logic

DOI10.1007/978-3-642-02261-6_26zbMath1246.03074OpenAlexW1836554196MaRDI QIDQ3638293

Linda Postniece

Publication date: 2 July 2009

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (3)

Nested sequents for intuitionistic logics ⋮ A Connection-Based Characterization of Bi-intuitionistic Validity ⋮ A connection-based characterization of bi-intuitionistic validity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cut-free sequent calculi for some tense logics
• Analyzing the core of categorial grammar
• Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
• Taming Displayed Tense Logics Using Nested Sequents with Deep Inference
• Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
• Contraction-free sequent calculi for intuitionistic logic
• Substructural logics on display
• A Formulae-as-Types Interpretation of Subtractive Logic
• A system of interaction and structure
• A Local System for Intuitionistic Logic

This page was built for publication: Deep Inference in Bi-intuitionistic Logic