Skip to main content

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

Abstract

In [2] Gentzen calculi for intuitionistic logic extended with an existence predicate were introduced. Such logics were first introduced by Dana Scott, who provided a proof system for it in Hilbert style.The logic seems particularly useful in settings where non constant domain Kripke models play a role. In this paper it is proved that these systems have interpolation and the Beth definability property.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Baaz, M., Iemhoff, R.: Skolemization in intuitionistic logic (2005) (manuscript)

    Google Scholar 

  2. Baaz, M., Iemhoff, R.: Gentzen calculi for the existence predicate. Studia Logica (to appear)

    Google Scholar 

  3. Beckmann, A., Preining, N.: Linear Kripke Frames and Gödel Logics (2005) (submitted)

    Google Scholar 

  4. Beeson, M.: Foundations of Constructive Mathematics. Springer, Berlin (1985)

    MATH  Google Scholar 

  5. Corsi, G.: A cut-free calculus for Dummett’s LC quantified. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 35, 289–301 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  6. Corsi, G.: A logic characterized by the class of connected models with nested domains. Studia Logica 48(1), 15–22 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Corsi, G.: Completeness theorem for Dummett’s LC quantified and some of its extensions. Studia Logica 51(2), 317–335 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Heyting, A.: Die formalen Regeln der intuitionistische Mathematik II. In: Sitzungsberichte der Preussischen Akademie von Wissenschaften. Physikalisch-mathematische Klasse, pp. 57–71 (1930)

    Google Scholar 

  9. Iemhoff, R.: A note on linear Kripke models. Journal of Logic and Computation (to appear)

    Google Scholar 

  10. Mints, G.E.: Axiomatization of a Skolem function in intuitionistic logic. In: Faller, M., et al. (eds.) Formalizing the dynamics of information. CSLI Lect. Notes, vol. 91, pp. 105–114 (2000)

    Google Scholar 

  11. Preining, N.: Complete Recursive Axiomatizability of Gödel Logics. PhD-thesis, Technical University Vienna (2003)

    Google Scholar 

  12. Scott, D.S.: Identity and existence in intuitionistic logic. In: Fourman, et al. (eds.) Applications of sheaves, Proc. Res. Symp. Durham 1977. Lect. Notes Math, vol. 753, pp. 660–696 (1979)

    Google Scholar 

  13. Takano, M.: Another proof of the strong completeness of the intuitionistic fuzzy logic. Tsukuba J. Math. 11(1), 101–105 (1987)

    MATH  MathSciNet  Google Scholar 

  14. Takeuti, G.: Proof Theory. North-Holland Publishing Company, Amsterdam (1979)

    Google Scholar 

  15. Takeuti, G., Titani, M.: Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. Journal of Symbolic Logic 49, 851–866 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  16. Troelstra, A.S., van Dalen, D.: Constructivism in Mathematics, vol. I. North-Holland, Amsterdam (1988)

    Google Scholar 

  17. Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, vol. 43. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  18. Unterhalt, M.: Kripke-Semantik mit partieller Existenz. PhD-thesis, University of Münster (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baaz, M., Iemhoff, R. (2005). On Interpolation in Existence Logics. In: Sutcliffe, G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11591191_48

Download citation

  • DOI: https://doi.org/10.1007/11591191_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30553-8

  • Online ISBN: 978-3-540-31650-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics