Skip to main content
SpringerLink
Log in

Parallel Dialogue Games and Hypersequents for Intermediate Logics

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2003)

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

Abstract

A parallel version of Lorenzen’s dialogue theoretic foundation for intuitionistic logic is shown to be adequate for a number of important intermediate logics. The soundness and completeness proofs proceed by relating hypersequent derivations to winning strategies for parallel dialogue games. This also provides a computational interpretation of hypersequents.

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. Abramsky, S., Jagadeesan, R.: Games and Full Completeness for Multiplicative Linear Logic. J. Symbolic Logic 59(2), 543–574 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Blass, A.: A Game Semantics for Linear Logic. Annals of Pure and Applied Logic 56, 183–220 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Annals of Mathematics and Artificial Intelligence 4, 225–248 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ciabattoni, A., Ferrari, M.: Hypersequent calculi for some intermediate logics with bounded Kripke models. Journal of Logic and Computation 2(11), 283–294 (2001)

    Article  MathSciNet  Google Scholar 

  5. Ciabattoni, A., Gabbay, D.M., Olivetti, N.: Cut-free proof systems for logics of weak excluded middle. Soft Computing 2(4), 147–156 (1998)

    Google Scholar 

  6. Dummett, M.: A propositional calculus with denumerable matrix. J. Symbolic Logic 24, 97–106 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dunn, J.M., Meyer, R.K.: Algebraic completeness results for Dummett’s LC and its extensions. Z. Math. Logik Grundlagen Math. 17, 225–230 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  8. Felscher, W.: Dialogues, Strategies, and Intuitionistic Provability. Annals of Pure and Applied Logic 28, 217–254 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  9. Felscher, W.: Dialogues as Foundation for Intuitionistic Logic. In: Gabbay, D., Günther, F. (eds.) Handbook of Philosophical Logic, vol. III, pp. 341–372. Reidel, Dordrecht (1986)

    Google Scholar 

  10. Fermüller, C.G., Ciabattoni, A.: From Intuitionistic Logic to Gödel-Dummett Logic via Parallel Dialogue Games. In: 33rd Intl.Symp.on Multiple-Valued Logic, Tokyo, May 2003, pp. 188–193. IEEE Press, Los Alamitos (2003)

    Chapter  Google Scholar 

  11. Gödel, K.: Zum intuitionistischen Aussagenkalkül. Anz. Akad. Wiss. Wien 69, 65–66 (1932)

    Google Scholar 

  12. Jankov, V.: The calculus of the weak “law of excluded middle”. Mathematics of the USSR 8, 648–658 (1968)

    Google Scholar 

  13. Krabbe, E.C.W.: Formal Systems of Dialogue Rules. Synthese 63, 295–328 (1985)

    Article  MathSciNet  Google Scholar 

  14. Krabbe, E.C.W.: Dialogue Sequents and Quick Proofs of Completeness. In: Hoepelman, J.P. (ed.) Representation and Reasoning, pp. 135–140. Max Niemeyer Verlag (1988)

    Google Scholar 

  15. Lorenzen, P.: Logik und Agon. In: Atti Congr. Internat. di Filosofia, Sansoni, Firenze, vol. 4, pp. 187–194 (1960)

    Google Scholar 

  16. Rahman, S.: Über Dialoge, Protologische Kategorien und andere Seltenheiten. Europäische Hochschulschriften, Peter Lang (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Wien, Austria

    Christian G. Fermüller

Authors
  1. Christian G. Fermüller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Automazione, Università di Roma Tre, via Vasca Navale 79, 00146, Roma, Italia

    Marta Cialdea Mayer

  2. Dipartimento di Informatica e Sistemistica (DIS), Sapienza, University of Rome “Sapienza”, via Ariosto 25, 00185, Roma

    Fiora Pirri

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fermüller, C.G. (2003). Parallel Dialogue Games and Hypersequents for Intermediate Logics. In: Cialdea Mayer, M., Pirri, F. (eds) Automated Reasoning with Analytic Tableaux and Related Methods . TABLEAUX 2003. Lecture Notes in Computer Science(), vol 2796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45206-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45206-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40787-4

  • Online ISBN: 978-3-540-45206-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation