Skip to main content
SpringerLink
Log in

A Connection-Based Characterization of Bi-intuitionistic Validity

  • Conference paper
Book cover Automated Deduction – CADE-23 (CADE 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6803))

Included in the following conference series:

Abstract

We give a connection-based characterization of validity in propositional bi-intuitionistic logic in terms of specific directed graphs called R-graphs. Such a characterization is well-suited for deriving labelled proof-systems with counter-model construction facilities. We first define the notion of bi-intuitionistic R-graph from which we then obtain a connection-based characterization of propositional bi-intuitionistic validity and derive a sound and complete free-variable labelled sequent calculus that admits cut-elimination and also variable splitting.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antonsen, R., Waaler, A.: A labelled system for IPL with variable splitting. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 132–146. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Crolard, T.: Substractive logic. Theoretical Computer Science 254(1-2), 151–185 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Crolard, T.: A formulae-as-types interpretation of substractive logic. Journal of Logic and Computation 14(4), 529–570 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Galmiche, D., Méry, D.: Characterizing provability in bI’s pointer logic through resource graphs. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 459–473. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Galmiche, D., Méry, D.: Resource graphs and countermodels in resource logics. Electronic Notes in Theoretical Computer Science 125(3), 117–135 (2005)

    Article  MATH  Google Scholar 

  6. Goré, R., Postniece, L., Tiu, A.: Cut-elimination and proof-search for Bi-intuitionistic logic using nested sequents. In: Advances in Modal Logic, vol. 7, pp. 43–66. College Publications, London (2008)

    Google Scholar 

  7. Negri, S.: Proof analysis in modal logic. J. of Philos. Logic 34(5-6), 507–554 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Otten, J., Kreitz, C.: T-string-unification: unifying prefixes in non classical proof methods. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS (LNAI), vol. 1071, pp. 244–260. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  9. Pinto, L., Uustalu, T.: Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS (LNAI), vol. 5607, pp. 295–309. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Postniece, L.: Deep inference in bi-intuitionistic logic. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol. 5514, pp. 320–334. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Rauszer, C.: An algebraic and Kripke-style approach to a certain extension of intuitionistic logic. Dissertationes Mathematicae 168 (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LORIA - Université Henri Poincaré, Campus Scientifique, BP 239, Vandœuvre-lés-Nancy, France

    Didier Galmiche & Daniel Méry

Authors
  1. Didier Galmiche
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Méry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, 98052-6399, Redmond, WA, USA

    Nikolaj Bjørner

  2. Max-Planck-Institut für Informatik, Campus E 1.4, 66123, Saarbrücken, Germany

    Viorica Sofronie-Stokkermans

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Galmiche, D., Méry, D. (2011). A Connection-Based Characterization of Bi-intuitionistic Validity. In: Bjørner, N., Sofronie-Stokkermans, V. (eds) Automated Deduction – CADE-23. CADE 2011. Lecture Notes in Computer Science(), vol 6803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22438-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22438-6_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22437-9

  • Online ISBN: 978-3-642-22438-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation