-
67A coding of the countable linear orderingsStudia Logica 49 (4): 585-590. 1990.Associate to any linear ordering on the integers the mapping whose value on n is the cardinality of {kn; kn}: a purely combinatorial characterization for the mappings associated to the well-orderings is established.
-
1286Another use of set theoryBulletin of Symbolic Logic 2 (4): 379-391. 1996.Here, we analyse some recent applications of set theory to topology and argue that set theory is not only the closed domain where mathematics is usually founded, but also a flexible framework where imperfect intuitions can be precisely formalized and technically elaborated before they possibly migrate toward other branches. This apparently new role is mostly reminiscent of the one played by other external fields like theoretical physics, and we think that it could contribute to revitalize the in…Read more
-
955Iterated ultrapowers and prikry forcingAnnals of Mathematical Logic 15 (2): 109-160. 1978.If $U$ is a normal ultrafilter on a measurable cardinal $\kappa$, then the intersection of the $\omega$ first iterated ultrapowers of the universe by $U$ is a Prikry generic extension of the $\omega$th iterated ultrapower.
-
108Laver’s results and low-dimensional topologyArchive for Mathematical Logic 55 (1-2): 49-83. 2016.In connection with his interest in selfdistributive algebra, Richard Laver established two deep results with potential applications in low-dimen\-sional topology, namely the existence of what is now known as the Laver tables and the well-foundedness of the standard ordering of positive braids. Here we present these results and discuss the way they could be used in topological applications.
-
141An application of ultrapowers to changing cofinalityJournal of Symbolic Logic 48 (2): 225-235. 1983.If $U_\alpha$ is a length $\omega_1$ sequence of normal ultrafilters on a measurable cardinal $\kappa$ that is increaing w.r.t. the Mitchel order, then the intersection of the $\omega_1$ first iterated ultrapowers of the universe is a Magidor generic extension of the $\omega_1$th iterated ultrapower.
-
39"[Product]"¹1-complete families of elementary sequencesAnnals of Pure and Applied Logic 38 (3): 257. 1988.If $j$ is an iterable elementary embedding of a model of ZFC into one of its submodels, and, for $\gamma: \omega\to\omega$, one defines $j_\gamma$ to be the sequence whose $n$th entry is the $\gamma(n)$th iterate of $j$, then the family of all sequences $j_\gamma$ is $\Pi_1^1$-complete.
