On a second order propositional operator in intuitionistic logic

Studia Logica 40:113 (1981)
  Copy   BIBTEX

Abstract

This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by * ≡ ∃Q. In full topological models * is not generally definable but over Cantor-space and the reals it can be classically shown that *↔ ⅂⅂P; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order predicate logic. Over [0, 1], the operator * is undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness. Parameters of the required kind can be obtained as so-called projections of lawless sequences

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,709

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Axiomatizations of intuitionistic double negation.Milan Bozic & Kosta Došen - 1983 - Bulletin of the Section of Logic 12 (2):99-102.
Intuitionistic completeness for first order classical logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
Intuitionistic Completeness and Classical Logic.D. C. McCarty - 2002 - Notre Dame Journal of Formal Logic 43 (4):243-248.
Negationless intuitionism.Enrico Martino - 1998 - Journal of Philosophical Logic 27 (2):165-177.
Intuitionistic completeness of first-order logic.Robert Constable & Mark Bickford - 2014 - Annals of Pure and Applied Logic 165 (1):164-198.

Analytics

Added to PP
2015-02-06

Downloads
14 (#986,446)

6 months
5 (#628,512)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Anne Troelstra
Last affiliation: University of Amsterdam

Citations of this work

Pitts' Quantifiers Are Not Topological Quantification.Tomasz Połacik - 1998 - Notre Dame Journal of Formal Logic 39 (4):531-544.
Propositional Quantification in the Topological Semantics for S.Philip Kremer - 1997 - Notre Dame Journal of Formal Logic 38 (2):295-313.

Add more citations