Abstract
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.
References
C. Celluci,Un connettivo per la logica intuizionista,Le Matematiche 29 (1974), pp. 274–290.
D. Gabbay,On some new intuitionistic propositional connectives,Stadia Logica 36 (1977), pp. 127–139.
C. A. Goad,Monadic infinitary propositional logic: a special operator,Reports of Mathematical Logic 10 (1978), pp. 43–50.
A. Heyting,Intuitionism, an Introduction, North-Holland, Amsterdam, 1956.
G. F. van der Hoeven andA. S. Troelstra,Projections of lawless sequences II,Report 78-09, Dept. of Mathematics, University of Amsterdam; appeared in: M. Boffa, D. van Dalen, K. McAloon (editors),Logic Colloquium 78, North-Holland, Amsterdam, 1979, pp. 265–298.
D. H. J. de Jongh,Investigations on the intuitionistic propositional calculus, Thesis, University of Wisconsin, Madison, 1968.
D. H. J. de Jongh,A class of intuitionistic connectives, in K. J. Barwise, J. Keisler, K. Kunen (editors),The Kleene Symposium, North-Holland, Amsterdam, 1980.
D. H. J. de Jongh andA. S. Troelstra (1966),On the connection of partially ordered sets with some pseudo-boolean algebras,Indagationes Mathematicae 28 (1966), pp. 317–329.
G. Kreisel,Constructivist approaches to Logic, in: E. Agazzi (editor),Modern Logic. A survey, D. Reidel, Dordrecht, 1980.
G. Kreisel,Monadic operators defined by means of propositional quantification in intuitionistic logic. To appear inReports of Mathematical Logic 12.
G. Kreisel andA. S. Troelstra,Formal systems for some branches of intuitionistic analysis,Annals of Mathematical Logic 1 (1970), pp. 229–387.
M. Mandelkern,Connectivity of an interval,Proceedings of the American Mathematical Society 54 (1976), pp. 170–172.
I. Nishimura,On formulas of one variable in intuitionistic propositional calculus,Journal of Symbolic Logic 25 (1960), pp. 327–331.
L. Rieger,On the lattice theory of Brouwerian propositional logic,Acta Facultatis Rerum Naturalium Universitatis Carolinae. Mathematica 189 (1949).
C. A. Smorynski,Investigations of intuitionistic formal systems by means of Kripke models. Ph. D. Thesis, University of Illinois at Chicago Circle, 1973.
A. S. Troelstra,Principles of Intuitionism, Springer-Verlag, Berlin, 1969.
A. S. Troelstra,Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, Springer-Verlag, Berlin, 1973.
A. S. Troelstra,Choice Sequences, Clarendon Press, Oxford, 1977.
A. S. Troelstra,Completeness and validity for intuitionistic predicate logic, in: M. Guillaume (editor),Colloque International de Logique, Clermont-Ferrand, 18–25 juillet 1975, Éditions du C. N. R. S. Paris, 1977, pp. 39–58.
A. S. Troelstra,A supplement to “Choice Sequences”, Report 79-04, Dept. of Mathematics, University of Amsterdam, 1979.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Troelstra, A.S. On a second order propositional operator in intuitionistic logic. Stud Logica 40, 113–139 (1981). https://doi.org/10.1007/BF01874704
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01874704