Journal of Symbolic Logic 44 (3):374 - 382 (1979)
|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 α|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Steve Matthews (2008). Privacy, Separation, and Control. The Monist 91 (1):130-150.
Kira Fuchs, Kira Boerner & Florian Herold, The Costs and Benefits of a Separation of Powers - an Incomplete Contracts Approach.
Richard Gostanian (1980). Constructible Models of Subsystems of ZF. Journal of Symbolic Logic 45 (2):237-250.
Joakim Sandberg (2008). Understanding the Separation Thesis. Business Ethics Quarterly 18 (2):213-232.
A. James Humphreys & Stephen G. Simpson (1999). Separation and Weak König's Lemma. Journal of Symbolic Logic 64 (1):268-278.
T. A. Slaman (1986). ∑1 Definitions with Parameters. Journal of Symbolic Logic 51 (2):453 - 461.
Arthur D. Grainger (1994). Flat Sets. Journal of Symbolic Logic 59 (3):1012-1021.
Fred G. Abramson (1981). Locally Countable Models of Σ1-Separation. Journal of Symbolic Logic 46 (1):96 - 100.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads2 ( #245,680 of 722,750 )
Recent downloads (6 months)0
How can I increase my downloads?