Questions tagged [constructibility]
This tag is for questions about Gödel's constructible universe $L$, and related constructions such as $L[X]$ and $L(X)$.
24
questions with no upvoted or accepted answers
10
votes
0
answers
349
views
Is there a "hereditary" construction for $L$?
Recall that $L$, Godel's constructible universe is constructed by defining the following hierarchy:
$L_0=\varnothing$, for a limit ordinal $\delta$, $L_\delta=\bigcup_{\alpha<\delta}L_\alpha$, and ...
- 38.2k
6
votes
0
answers
196
views
Consistency strength of Sy Friedman's result about admissibility spectrum
A result by Sy Friedman in his book "fine structure and class forcing", is that, assume $0^\sharp$ exists, there exists a real number R such that the ordinals admissible in R (called $\...
- 1,410
6
votes
0
answers
427
views
Inaccessible cardinals and the perfect set property for coanalytic sets
I am wondering who proved the following fact:
($\ast$) If $\omega_1$ is not inaccessible in $L$, then there is an uncountable coanalytic set of reals without a perfect subset.
I have been unable to ...
- 5,551
4
votes
0
answers
174
views
Some questions on a paper of Gerald Sacks
I've been reading Sacks' Countable admissible ordinals and hyperdegrees as I'm interested in Theorem 5.3 of the paper:
Let $M$ be a countable standard model of $\mathsf{ZF}$ and $V=L$. Suppose $\...
- 2,134
4
votes
0
answers
145
views
Slicing large countable ordinal properties, from $\Pi_3$-reflection to $\Sigma_2$-admissibility
Edit 2024: This post was based on an incorrect premise, as can be seen by my conversation with Farmer S in the comments. However the mistake I made and the conversation in comments may be instructive (...
- 1,288
4
votes
0
answers
144
views
Can this reflective class theory interpret ZFC?
Reflective Set Theory $\mathsf{RfST}$ is formulated in first order predicate logic with extra-logical primitives of equality $``="$, membership $``\in"$, and a single primitive constant symbol $V$ ...
- 9,266
3
votes
0
answers
243
views
Is this recursion theoretic analogue of a criterion of weakly compact cardinal accurate?
Jensen proved that, if V=L, and $\kappa$ is a regular cardinal, then if for any stationary $A\subseteq \kappa$, the set $\{\alpha\mid A \text{ is stationary below }\alpha\}$ is stationary in $\kappa$, ...
- 1,410
3
votes
0
answers
120
views
At which large cardinal property this second order ordinal arithmetic stops?
Language: Second order logic, with as usual predicates written in upper case, and objects in lower case. Let $<$ be a primitive constant binary relation symbol.
Equality between objects is ...
- 9,266
3
votes
0
answers
678
views
Can there be ordinals larger than those contained in Ord, and if so, can they be used to extend the constructible universe $L$?
Can there be ordinals larger than those contained in Ord, the class of all ordinals,and if so, can these ordinals be used to extend the constructible universe $L$?
In a simplified form, my question ...
- 6,024
2
votes
0
answers
119
views
Higher-order oracle computation of reals and axiom of constructibility
Certain real numbers can be approximated arbitrarily well by computable functions. If we introduce halting oracles, then more real numbers can be "computed", like Chaitin's constant or the ...
- 41
2
votes
1
answer
303
views
What's the order type of the following set?
Fix a positive integer n. Assume $Lan=\{R_0,R_1,...,R_n\}$ be a language of first order logic, where every $R_i$ is a 2-ary relation symbol.
Assume $M$ is an Lan-model, where the underlying set is $...
- 1,410
2
votes
0
answers
165
views
Why can't $L_\beta$ contain a real coding a well-ordering of order-type $\beta$, when $\beta$ is a gap ordinal?
In Gaps in the constructible universe, Marek and Srebrny, 1973 a gap ordinal is defined as follows
$\alpha$ is a gap ordinal iff $(L_{\alpha+1}-L_\alpha)\cap \mathcal{P}(\omega) = \emptyset$
Their ...
- 421
2
votes
0
answers
212
views
When is a $\Sigma_n$ Skolem hull a proper submodel?
For $M$ an amenable structure and $X \subset M$, the $\Sigma_n$ Skolem hull of $X$ is a $\Sigma_n$-elementary submodel of $M$. That is, as presentend in Devlin, Constructibility, pp. 85-88, for $h_n$ ...
- 531
2
votes
0
answers
144
views
When do wide initial segments ruin admissibility?
Suppose $\alpha$ is admissible and $\beta<\alpha$. We know that $L_\alpha$ is an admissible set (by definition), but adding subsets of $\beta$ to $L_\alpha$ might break admissibility: while set ...
- 19.3k
2
votes
0
answers
125
views
Does $\forall X \in L_{\kappa}: P(X) \subset L_{\kappa}$ hold in $L$
While working on an exercise in Jech's Set Theory, I tried to prove that if $V=L$, then $\forall X \in L_{\kappa}: P(X) \subset L_{\kappa}$, where $k$ is any cardinal. I was hoping someone could ...
- 281
1
vote
0
answers
163
views
How does the cardinality of a set and its powerset compare in the hereditarily rank-concordant constructible world?
Working in the constructible universe "$L$", if we define two kinds of ranks for any constructible set $x$, one being the ordinal index of the first $L_\alpha$ where $x$ appears as a subset ...
- 9,266
1
vote
0
answers
161
views
Can the Constructible Universe be built in absence of Unions and Power?
Can $L$ be built in
$\sf ZF$ $\sf-Regularity-Union-Power+ Boolean \ Union$?
We know that $L$ can be built in $\sf KP$, but here we don't have Set Union.
If the answer is to the negative, then would ...
- 9,266
1
vote
0
answers
136
views
Must models of the following theory satisfying opposing infinitary sentences, satisfy opposing finitary sentences?
This is a follow-up to posting titled "Is this theory finitary first order complete?"
Recall the theory presented at that posting. Replace the size axiom by the following:
$\textbf{...
- 9,266
1
vote
0
answers
257
views
Is Jensen's covering lemma meaningful in a platonist's view?
The typical applications of fine structure theory are finding out the lower bounds of consistency strength of axiom systems. In such a proccess, we also constructs many combinatorial objects in core ...
- 1,410
1
vote
0
answers
152
views
Can Jensen's covering lemma be proven easier in generic extensions of L?
Jensen's covering lemma, stating that if there is no $0^\#$ in V, then some covering property holds true, has a very complex proof.
In any generic extension L[G] of L, $0^\#$ don't exist, so the ...
- 1,410
1
vote
0
answers
70
views
Can all sets in stratified L above some stage be proximate?
Define stratified $L$, denoted by $^S L$, as:
Let $S$ be the set of all stratified formulas in first order language of set theory.
Define:
${ }^S Def (X) = \{\{y \in X \mid (X, \in) \models \phi(y,z_1,...
- 9,266
0
votes
0
answers
143
views
How to define BHO alternatives below admissible ordinals?
Bachmann-Howard ordinal is a recursive ordinal. It's not that large compared to those proof-theoretic ordinals of stronger theories, but the definition of BHO is sufficient to illustrate how ...
- 1,410
0
votes
0
answers
190
views
Does the following characterization of the elements of $\mathscr P$($\omega$) fail for ITTM's?
Hartley Rogers Jr., on pg. 120 of his text, Theory of Recursive Functions and Effective Computability, presents and discusses the following characterization of the sets in $\mathscr P(\omega)$:
$\...
- 6,024
0
votes
0
answers
148
views
Is "ZF+ V=L" an upper limit theory for cardinal decidability (per its strength)?
{EDIT: this posting has been edited, the additional text is in italics}
If $\varphi, \psi$ are two parameter free formulas in the language of set theory $T$ such that there is a theorem of $T$ that ...
- 9,266