This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by. In full topological models * is not generally definable, but over Cantor-space and the reals it can be classically shown that; 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 (constructively and classically) 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.
[1]
A. Troelstra.
Metamathematical investigation of intuitionistic arithmetic and analysis
,
1973
.
[2]
A. Troelstra,et al.
Formal systems for some branches of intuitionistic analysis
,
1970
.
[3]
De Jongh,et al.
Investigations on the intuitionistic propositional calculus
,
1968
.
[4]
Mark Mandelker.
Connectivity of an interval
,
1976
.
[5]
D. Gabbay.
On some new intuitionistic propositional connectives. I
,
1977
.
[6]
Iwao Nishimura,et al.
On Formulas of One Variable in Intuitionistic Propositional Calculus
,
1960,
J. Symb. Log..
[7]
A. S. Troelstra,et al.
On the connection of partially ordered sets with some pseudo-Boolean algebras
,
1966
.