Effective topological spaces III: Forcing and definability

&
Annals of Pure and Applied Logic 36:17-27 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(87)90009-1

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Effective topological spaces I: A definability theory.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (1):1-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.
Topological forcing semantics with settling.Robert S. Lubarsky - 2012 - Annals of Pure and Applied Logic 163 (7):820-830.
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.
Kenneth McAloon. On the sequence of models HODn. Fundamenta mathematicae, vol. 82 , pp. 85–93. - Thomas J. Jech. Forcing with trees and ordinal definability. Annals of mathematical logic, vol. 7 no. 4 , pp. 387–409. - Włodzimierz Zadrożny. Iterating ordinal definability. Annals of pure and applied logic, vol. 24 , pp. 263–310. [REVIEW]Rene David - 1987 - Journal of Symbolic Logic 52 (2):570-571.
Some remarks on a theorem of Iraj Kalantari concerning convexity and recursion theory.R. Downey - 1984 - Mathematical Logic Quarterly 30 (19‐24):295-302.
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.
Effective topological spaces II: A hierarchy.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (2):207-224.

Analytics

Added to PP
2014-01-16

Downloads
21 (#1,010,345)

6 months
6 (#873,397)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effective topological spaces I: A definability theory.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (1):1-27.
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.

Add more citations

References found in this work

Recursive predicates and quantifiers.S. C. Kleene - 1943 - Transactions of the American Mathematical Society 53:41-73.
Arithmetical Predicates and Function Quantifiers.S. C. Kleene - 1956 - Journal of Symbolic Logic 21 (4):409-410.
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.
Simplicity in effective topology.Iraj Kalantari & Anne Leggett - 1982 - Journal of Symbolic Logic 47 (1):169-183.

View all 12 references / Add more references