Skip to main content
×
Home
    • Aa
    • Aa

ANALYTIC CUT AND INTERPOLATION FOR BI-INTUITIONISTIC LOGIC

  • TOMASZ KOWALSKI (a1) and HIROAKIRA ONO (a2)
Abstract
Abstract

We prove that certain natural sequent systems for bi-intuitionistic logic have the analytic cut property. In the process we show that the (global) subformula property implies the (local) analytic cut property, thereby demonstrating their equivalence. Applying a version of Maehara technique modified in several ways, we prove that bi-intuitionistic logic enjoys the classical Craig interpolation property and Maximova variable separation property; its Halldén completeness follows.

Copyright
Corresponding author
*DEPARTMENT OF MATHEMATICS AND STATISTICS LA TROBE UNIVERSITY MELBOURNE, VICTORIA 3086 AUSTRALIA E-mail: t.kowalski@latrobe.edu.au
JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY 1-1 ASAHIDAI, NOMI, ISHIKAWA 923-1292 JAPAN E-mail: ono@jaist.ac.jp
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

L. Buisman & R Goré . (2007). A cut-free sequent calculus for bi-intuitionistic logic. In N. Olivetti , editor. Automated Reasoning with Analytic Tableaux and Related Methods. Lecture Notes in Computer Science, Vol. 4548. Berlin: Springer, pp. 90106.

H. Kihara & H Ono . (2010). Interpolation properties, Beth definability properties and amalgamation properties for substructural logics. Journal of Logic and Computation, 20(4), 823875.

O. Lahav & A Avron . (2013). A unified semantic framework for fully structural propositional sequent systems. ACM Transactions on Computational Logic, 14(4), Art. 27, 133.

L Maksimova . (1976). The principle of separation of variables in propositional logics. Algebra and Logic, 15, 168184 (in Russian).

L. Pinto & T Uustalu . (2009). Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents. In Automated Reasoning with Analytic Tableaux and Related Methods. Lecture Notes in Computer Science, Vol. 5607. Berlin: Springer, pp. 295309.

C Rauszer . (1974). A formalization of the propositional calculus of H-B logic. Studia Logica, 33, 2334.

C Rauszer . (1977a). Applications of Kripke models to Heyting-Brouwer logic. Studia Logica, 36(1–2), 6171.

C Rauszer . (1977c). Model theory for an extension of intuitionistic logic. Studia Logica, 36(1–2), 7387.

H. P Sankappanavar . (1985). Heyting algebras with dual pseudocomplementation. Pacific Journal of Mathematics, 117(2), 405415.

F Wolter . (1998). On logics with coimplication. Journal of Philosophical Logic, 27(4), 353387.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 30 *
Loading metrics...

Abstract views

Total abstract views: 239 *
Loading metrics...

* Views captured on Cambridge Core between 6th December 2016 - 20th August 2017. This data will be updated every 24 hours.