Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents

DOI10.1007/978-3-642-02716-1_22zbMath1260.03105OpenAlexW2147768374MaRDI QIDQ3648737

Luís Pinto, Tarmo Uustalu

Publication date: 1 December 2009

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

Full work available at URL: http://hdl.handle.net/1822/11310

Mathematics Subject Classification ID

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

Related Items (10)

Formalized meta-theory of sequent calculi for linear logics ⋮ Natural deduction for bi-intuitionistic logic ⋮ Dualized Simple Type Theory ⋮ Proof analysis in intermediate logics ⋮ Formalized meta-theory of sequent calculi for substructural logics ⋮ Kripke Semantics for Basic Sequent Systems ⋮ A Connection-Based Characterization of Bi-intuitionistic Validity ⋮ Deep Inference in Bi-intuitionistic Logic ⋮ A connection-based characterization of bi-intuitionistic validity ⋮ ANALYTIC CUT AND INTERPOLATION FOR BI-INTUITIONISTIC LOGIC

This page was built for publication: Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents