-
78Baumgartnerʼs conjecture and bounded forcing axiomsAnnals of Pure and Applied Logic 164 (12): 1178-1186. 2013.We study the spectrum of forcing notions between the iterations of σ-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of α-proper forcings for indecomposable countable ordinals α, the Axiom A forcings and forcings completely embeddable into an iteration of a σ-closed followed by a ccc forcing. For the latter class, we present an equivalent characterization in terms of Baumgartnerʼs Axiom A. This resolves a conjecture of Baumgartner from the 1980s. We also stud…Read more
-
134The number of normal measuresJournal of Symbolic Logic 74 (3): 1069-1080. 2009.There have been numerous results showing that a measurable cardinal κ can carry exactly α normal measures in a model of GCH, where a is a cardinal at most κ⁺⁺. Starting with just one measurable cardinal, we have [9] (for α = 1), [10] (for α = κ⁺⁺, the maximum possible) and [1] (for α = κ⁺, after collapsing κ⁺⁺) . In addition, under stronger large cardinal hypotheses, one can handle the remaining cases: [12] (starting with a measurable cardinal of Mitchell order α ) , [2] (as in [12], but where κ…Read more
-
164On Borel equivalence relations in generalized Baire spaceArchive for Mathematical Logic 51 (3-4): 299-304. 2012.We construct two Borel equivalence relations on the generalized Baire space κκ, κ ω, with the property that neither of them is Borel reducible to the other. A small modification of the construction shows that the straightforward generalization of the Glimm-Effros dichotomy fails.
-
126HypermachinesJournal of Symbolic Logic 76 (2). 2011.The Infinite Time Turing Machine model [8] of Hamkins and Kidder is, in an essential sense, a "Σ₂-machine" in that it uses a Σ₂ Liminf Rule to determine cell values at limit stages of time. We give a generalisation of these machines with an appropriate Σ n rule. Such machines either halt or enter an infinite loop by stage ζ(n) = df μζ(n)[∃Σ(n) > ζ(n) L ζ(n) ≺ Σn L Σ(n) ], again generalising precisely the ITTM case. The collection of such machines taken together computes precisely those reals of …Read more
-
101An inner model for global dominationJournal of Symbolic Logic 74 (1): 251-264. 2009.In this paper it is shown that the global statement that the dominating number for k is less than $2^k $ for all regular k, is internally consistent, given the existence of $0^\# $ . The possible range of values for the dominating number for k and $2^k $ which may be simultaneously true in an inner model is also explored
-
57The tree property at the ℵ 2 n 's and the failure of SCH at ℵ ωAnnals of Pure and Applied Logic 166 (4): 526-552. 2015.
-
120Large cardinals and gap-1 morassesAnnals of Pure and Applied Logic 159 (1-2): 71-99. 2009.We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular uncountable cardinal, while preserving all n-superstrong, hyperstrong and 1-extendible cardinals. In the latter case, a preliminary forcing to make the GCH hold is required. Our forcing yields morasses that satisfy an extra property related to the homogeneity of t…Read more
-
148Slow consistencyAnnals of Pure and Applied Logic 164 (3): 382-393. 2013.The fact that “natural” theories, i.e. theories which have something like an “idea” to them, are almost always linearly ordered with regard to logical strength has been called one of the great mysteries of the foundation of mathematics. However, one easily establishes the existence of theories with incomparable logical strengths using self-reference . As a result, PA+Con is not the least theory whose strength is greater than that of PA. But still we can ask: is there a sense in which PA+Con is t…Read more
-
54Large cardinals and definable well-orders, without the GCHAnnals of Pure and Applied Logic 166 (3): 306-324. 2015.
-
176Fusion and large cardinal preservationAnnals of Pure and Applied Logic 164 (12): 1247-1273. 2013.In this paper we introduce some fusion properties of forcing notions which guarantee that an iteration with supports of size ⩽κ not only does not collapse κ+ but also preserves the strength of κ. This provides a general theory covering the known cases of tree iterations which preserve large cardinals [3], Friedman and Halilović [5], Friedman and Honzik [6], Friedman and Magidor [8], Friedman and Zdomskyy [10], Honzik [12]).
-
163Isomorphism relations on computable structuresJournal of Symbolic Logic 77 (1): 122-132. 2012.We study the complexity of the isomorphism relation on classes of computable structures. We use the notion of FF-reducibility introduced in [9] to show completeness of the isomorphism relation on many familiar classes in the context of all ${\mathrm{\Sigma }}_{1}^{1}$ equivalence relations on hyperarithmetical subsets of ω
-
523Definable well-orders of $H(\omega _2)$ and $GCH$Journal of Symbolic Logic 77 (4): 1101-1121. 2012.Assuming ${2^{{N_0}}}$ = N₁ and ${2^{{N_1}}}$ = N₂, we build a partial order that forces the existence of a well-order of H(ω₂) lightface definable over ⟨H(ω₂), Є⟩ and that preserves cardinal exponentiation and cofinalities.
-
98The Nonabsoluteness of Model Existence in Uncountable Cardinals for $L{omega{1},omega}$Notre Dame Journal of Formal Logic 54 (2): 137-151. 2013.For sentences $\phi$ of $L_{\omega_{1},\omega}$, we investigate the question of absoluteness of $\phi$ having models in uncountable cardinalities. We first observe that having a model in $\aleph_{1}$ is an absolute property, but having a model in $\aleph_{2}$ is not as it may depend on the validity of the continuum hypothesis. We then consider the generalized continuum hypothesis context and provide sentences for any $\alpha\in\omega_{1}\setminus\{0,1,\omega\}$ for which the existence of a model…Read more
-
184Potential isomorphism of elementary substructures of a strictly stable homogeneous modelJournal of Symbolic Logic 76 (3). 2011.The results herein form part of a larger project to characterize the classification properties of the class of submodels of a homogeneous stable diagram in terms of the solvability (in the sense of [1]) of the potential isomorphism problem for this class of submodels. We restrict ourselves to locally saturated submodels of the monster model m of some power π. We assume that in Gödel's constructible universe , π is a regular cardinal at least the successor of the first cardinal in which is stabl…Read more