-
21Large cardinals and definable well-orders, without the GCHAnnals of Pure and Applied Logic 166 (3): 306-324. 2015.
-
30Fusion 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]).
-
69Isomorphism 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 ω
-
79On the Consistency Strength of the Inner Model HypothesisJournal of Symbolic Logic 73 (2). 2008.