Skip to main content
SpringerLink
Log in

Propositional quantification in intuitionistic logic

  • Contributed Papers
  • Conference paper
  • First Online:
Computational Logic and Proof Theory (KGC 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1289))

Included in the following conference series:

  • 247 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. M. Gabbay, On 2nd order intuitionistic propositional calculus with full comprehension, Archiv für mathematische Logik 16 (1974), 177–186.

    Google Scholar 

  2. S. Ghilardi, M. Zawadowski, A sheaf representation and duality for finitely presented Heyting algebras, Journal of Symbolic Logic 60 (1995), 911–939.

    Google Scholar 

  3. A. Pitts, On an interpretation of second order quantification in the first order intuitionistic propositional logic, Journal of Symbolic Logic 57 (1992), 33–52.

    Google Scholar 

  4. T. Polacik, Propositional quantification in the monadic fragment of intuitionistic logic, to appear in Journal of Symbolic Logic.

    Google Scholar 

  5. T. Polacik, Pitts' quantifiers are not topological quantification, preprint.

    Google Scholar 

  6. A. Tarski, Der Aussagenkalkül und die Topologie, Fundamenta Mathemeticae 31 (1938),103–134.

    Google Scholar 

  7. A. Visser, Bisimulations, Model Descriptions and Propositional Quantifiers, Logic Group Preprint Series 161, Department of Philosophy, Utrecht University, Utrecht, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Silesia, Bankowa 14, 40007, Katowice, Poland

    Tomasz Polacik

Authors
  1. Tomasz Polacik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Polacik, T. (1997). Propositional quantification in intuitionistic logic. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1997. Lecture Notes in Computer Science, vol 1289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63385-5_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-63385-5_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63385-3

  • Online ISBN: 978-3-540-69806-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation