- 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
Effective topological spaces I: A definability theory
Annals of Pure and Applied Logic 29 (1):1-27 (1985)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Effective topological spaces III: Forcing and definability.Iraj Kalantari & Galen Weitkamp - 1987 - Annals of Pure and Applied Logic 36:17-27.
Modal languages for topology: Expressivity and definability.Balder ten Cate, David Gabelaia & Dmitry Sustretov - 2009 - Annals of Pure and Applied Logic 159 (1-2):146-170.
On the definability of mad families of vector spaces.Haim Horowitz & Saharon Shelah - 2022 - Annals of Pure and Applied Logic 173 (4):103079.
On the classification of (effective) φ-spaces.YuL Ershov - 2009 - Annals of Pure and Applied Logic 159 (3):285-291.
Dynamical algebraic structures, pointfree topological spaces and Hilbert's program.Henri Lombardi - 2006 - Annals of Pure and Applied Logic 137 (1-3):256-290.
Some remarks on a theorem of Iraj Kalantari concerning convexity and recursion theory.R. Downey - 1984 - Mathematical Logic Quarterly 30 (19‐24):295-302.
Some Remarks on a Theorem of Iraj Kalantari Concerning Convexity and Recursion Theory.R. Downey - 1984 - Mathematical Logic Quarterly 30 (19-24):295-302.
Topological models of epistemic set theory.Nicolas D. Goodman - 1990 - Annals of Pure and Applied Logic 46 (2):147-167.
Recursive and nonextendible functions over the reals; filter foundation for recursive analysis.II.Iraj Kalantari & Lawrence Welch - 1999 - Annals of Pure and Applied Logic 98 (1-3):87-110.
Analytics
Added to PP
2013-10-30
Downloads
23 (#939,354)
6 months
2 (#1,685,557)
2013-10-30
Downloads
23 (#939,354)
6 months
2 (#1,685,557)
Historical graph of downloads
Citations of this work
Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I.Iraj Kalantari & Lawrence Welch - 1998 - Annals of Pure and Applied Logic 93 (1-3):125-151.
Effective inseparability in a topological setting.Dieter Spreen - 1996 - Annals of Pure and Applied Logic 80 (3):257-275.
Effective topological spaces II: A hierarchy.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (2):207-224.
Effective topological spaces III: Forcing and definability.Iraj Kalantari & Galen Weitkamp - 1987 - Annals of Pure and Applied Logic 36:17-27.
Computable Topological Groups.K. O. H. Heer Tern, Alexander G. Melnikov & N. G. Keng Meng - forthcoming - Journal of Symbolic Logic:1-33.
References found in this work
Recursive predicates and quantifiers.S. C. Kleene - 1943 - Transactions of the American Mathematical Society 53:41-73.
Hierarchies of Number-Theoretic Predicates.S. C. Kleene - 1956 - Journal of Symbolic Logic 21 (4):411-412.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Arithmetical Predicates and Function Quantifiers.S. C. Kleene - 1956 - Journal of Symbolic Logic 21 (4):409-410.
Recursive Functionals and Quantifiers of Finite Types II.S. C. Kleene - 1971 - Journal of Symbolic Logic 36 (1):146-146.
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-667477cd97-7qg25 dc2