- 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 nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations
Journal of Symbolic Logic 40 (3):321-346 (1975)
Abstract
This article has no associated abstract. (fix it)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
Cut-free tableau calculi for some intuitionistic modal logics.Mauro Ferrari - 1997 - Studia Logica 59 (3):303-330.
Derived rules of inference related to the continuity of effective operations.Michael J. Beeson - 1976 - Journal of Symbolic Logic 41 (2):328-336.
Church's thesis, continuity, and set theory.M. Beeson & A. Ščedrov - 1984 - Journal of Symbolic Logic 49 (2):630-643.
Isomorphisms between HEO and HROE, ECF and ICFE.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (2):359 - 371.
Glivenko type theorems for intuitionistic modal logics.Guram Bezhanishvili - 2001 - Studia Logica 67 (1):89-109.
Intuitionistic mathematics does not needex falso quodlibet.Neil Tennant - 1994 - Topoi 13 (2):127-133.
A first approach to abstract modal logics.Josep M. Font & Ventura Verdú - 1989 - Journal of Symbolic Logic 54 (3):1042-1062.
Syntactic Preservation Theorems for Intuitionistic Predicate Logic.Jonathan Fleischmann - 2010 - Notre Dame Journal of Formal Logic 51 (2):225-245.
The unprovability in intuitionistic formal systems of the continuity of effective operations on the reals.Michael Beeson - 1976 - Journal of Symbolic Logic 41 (1):18-24.
Analytics
Added to PP
2009-01-28
Downloads
54 (#283,495)
6 months
17 (#132,430)
2009-01-28
Downloads
54 (#283,495)
6 months
17 (#132,430)
Historical graph of downloads
Citations of this work
Substitutions of Σ10-sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic.Albert Visser - 2002 - Annals of Pure and Applied Logic 114 (1-3):227-271.
Recursive models for constructive set theories.M. Beeson - 1982 - Annals of Mathematical Logic 23 (2-3):127-178.
On the completenes principle: A study of provability in heyting's arithmetic and extensions.Albert Visser - 1982 - Annals of Mathematical Logic 22 (3):263-295.
Strong continuity implies uniform sequential continuity.Douglas Bridges, Hajime Ishihara, Peter Schuster & Luminiţa Vîţa - 2005 - Archive for Mathematical Logic 44 (7):887-895.
Arguments for the continuity principle.Mark van Atten & Dirk van Dalen - 2002 - Bulletin of Symbolic Logic 8 (3):329-347.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Mathematical Logic.Georg Kreisel - 1965 - In Lectures on Modern Mathematics. New York: Wiley. pp. 95-195.
Number theoretic concepts and recursive well-orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1960 - Archive for Mathematical Logic 5 (1-2):42-64.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
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
Server: philpapers-web-6d9b7f7c4c-tstkh uwo