- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The unprovability in intuitionistic formal systems of the continuity of effective operations on the reals
Journal of Symbolic Logic 41 (1):18-24 (1976)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations.Michael J. Beeson - 1975 - Journal of Symbolic Logic 40 (3):321-346.
Derived rules of inference related to the continuity of effective operations.Michael J. Beeson - 1976 - Journal of Symbolic Logic 41 (2):328-336.
Formal Methods: An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic.Leon Henkin - 1962 - Journal of Symbolic Logic 30 (2):235-236.
Formal Methods: An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic.Evert W. Beth - 1962 - Studia Logica 14:346-348.
Formal Methods. An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic. Evert W. Beth.Alan Rose - 1966 - Philosophy of Science 33 (1):84-85.
Harrop Ronald. Concerning formulas of the types A → B v C, A → B in intuitionistic formal systems. [REVIEW]T. Thacher Robinson - 1962 - Journal of Symbolic Logic 27 (1):110-111.
Bridge to abstract mathematics.Ralph W. Oberste-Vorth - 2012 - [Washington, DC]: American Mathematical Soc.. Edited by Aristides Mouzakitis & Bonita A. Lawrence.
A Philosophically Plausible Formal Interpretation of Intuitionistic Logic.Andrzej Grzegorczyk - 1971 - Journal of Symbolic Logic 36 (2):329-329.
Church's thesis, continuity, and set theory.M. Beeson & A. Ščedrov - 1984 - Journal of Symbolic Logic 49 (2):630-643.
Total sets and objects in domain theory.Ulrich Berger - 1993 - Annals of Pure and Applied Logic 60 (2):91-117.
Analytics
Added to PP
2009-01-28
Downloads
245 (#168,214)
6 months
73 (#138,287)
2009-01-28
Downloads
245 (#168,214)
6 months
73 (#138,287)
Historical graph of downloads
Citations of this work
Effective inseparability in a topological setting.Dieter Spreen - 1996 - Annals of Pure and Applied Logic 80 (3):257-275.
Principles of continuous choice and continuity of functions in formal systems for constructive mathematics.Michael J. Beeson - 1977 - Annals of Mathematical Logic 12 (3):249.
Recursive models for constructive set theories.N. Beeson - 1982 - Annals of Mathematical Logic 23 (2-3):127-178.
References found in this work
Errett Bishop. Foundations of constructive analysis. McGraw-Hill Book Company, New York, San Francisco, St. Louis, Toronto, London, and Sydney, 1967, xiii + 370 pp. - Errett Bishop. Mathematics as a numerical language. Intuitionism and proof theory, Proceedings of the summer conference at Buffalo N.Y. 1968, edited by A. Kino, J. Myhill, and R. E. Vesley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam and London1970, pp. 53–71.John Myhill - 1972 - Journal of Symbolic Logic 37 (4):744-747.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation