Connection-based proof search in propositional BI logic

DOI10.1007/3-540-45620-1_8MaRDI QIDQ4809046zbMATH OpenFDO

Authors Didier Galmiche, Daniel Méry

Publication date 12 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2392/23920111.htm

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• scientific article; zbMATH DE number 2242591
• The Logic of Bunched Implications
• A connection-based characterization of bi-intuitionistic validity
• A connection-based characterization of bi-intuitionistic validity
• Semantic Labelled Tableaux for Propositional BI

Cited in

(5)

• Focused proof-search in the logic of bunched implications
• A connection-based characterization of bi-intuitionistic validity
• BI as an assertion language for mutable data structures
• A connection-based characterization of bi-intuitionistic validity
• scientific article; zbMATH DE number 2242591 (Why is no real title available?)

This page was built for publication: Connection-based proof search in propositional BI logic

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