Σ1-separation

Journal of Symbolic Logic 44 (3):374 - 382 (1979)
  Copy   BIBTEX

Abstract

Let A be a standard transitive admissible set. Σ 1 -separation is the principle that whenever X and Y are disjoint Σ A 1 subsets of A then there is a Δ A 1 subset S of A such that $X \subseteq S$ and $Y \cap S = \varnothing$ . Theorem. If A satisfies Σ 1 -separation, then (1) If $\langle T_n\mid n is a sequence of trees on ω each of which has at most finitely many infinite paths in A then the function $n\mapsto$ (set of infinite paths in A through T n ) is in A. (2) If A is not closed under hyperjump and α = On A then A has in it a nonstandard model of V = L whose ordinal standard part is α. Theorem. Let α be any countable admissible ordinal greater than ω. Then there is a model of Σ 1 -separation whose height is α.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

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

Through your library

Similar books and articles

Locally countable models of Σ1-separation.Fred G. Abramson - 1981 - Journal of Symbolic Logic 46 (1):96 - 100.
On the Π1 1 -separation principle.Antonio Montalbán - 2008 - Mathematical Logic Quarterly 54 (6):563-578.
Séparation précoce : traumatisme de la première enfance?Myriam David - 2005 - Dialogue: Families & Couples 168 (2):97-105.
Dialectique de la séparation.Frédéric Neyrat - 2018 - Multitudes 72 (3):86-96.
Unpacking the Separation of Powers.Jiří Baroš, Pavel Dufek & David Kosař - 2020 - In Antonia Baraggia, Cristina Fasone & Luca Pietro Vanoni (eds.), New Challenges to the Separation of Powers : Dividing Power. pp. 124–143.
Forcing the [math]-separation property.Stefan Hoffelner - 2022 - Journal of Mathematical Logic 22 (2).
La séparation chez aristote.Richard Dufour - forthcoming - Les Etudes Philosophiques.

Analytics

Added to PP
2009-01-28

Downloads
108 (#159,307)

6 months
18 (#135,873)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
The problem of predicativity.Joseph R. Shoenfield - 1961 - In Bar-Hillel, Yehoshua & [From Old Catalog] (eds.), Essays on the Foundations of Mathematics. Jerusalem,: Magnes Press. pp. 132--139.

Add more references