We show how two iterated products of selection functions can both be used in conjunction with system T to interpret, via the dialectica interpretation and modified realizability, full classical analysis. We also show that one iterated product is equivalent over system T to Spector’s bar recursion, whereas the other is T-equivalent to modified bar recursion. Modified bar recursion itself is shown to arise directly from the iteration of a different binary product of ‘skewed’ selection functions. Iterations of the dependent binary products are also considered but in all cases are shown to be T-equivalent to the iteration of the simple products.

In this paper, we explore the structure theory of L(ℝ, μ) under the hypothesis L(ℝ, μ) ⊧ “AD + μ is a normal fine measure on ” and give some applications. First we show that “ ZFC + there exist ω2 Woodin cardinals”1 has the same consistency strength as “ AD + ω1 is ℝ-supercompact”. During this process we show that if L(ℝ, μ) ⊧ AD then in fact L(ℝ, μ) ⊧ AD+. Next we prove important properties of L(ℝ, μ) including Σ1 -reflection and the uniqueness of μ in L(ℝ, μ). Then we give the computation of full HOD in L(ℝ, μ). Finally, we use Σ1 -reflection and ℙmax forcing to construct a certain ideal on (or equivalently on in this situation) that has the same consistency strength as “ZFC+ there exist ω2 Woodin cardinals.”

The Axiom of Strong Condensation, first introduced by Woodin in [14], is an abstract version of the Condensation Lemma of L. In this paper, we construct a set-sized forcing to obtain Strong Condensation for H(ω2). As an application, we show that “ZFC + Axiom of Strong Condensation + ”is consistent, which answers a question in [14]. As another application, we give a partial answer to a question of Jech by proving that “ZFC + there is a supercompact cardinal + any ideal on ω1 which is definable over H(ω2) is not precipitous” is consistent under sufficient large cardinal assumptions.

In this note we investigate the question when a henselian valued field carries a nontrivial ∅-definable henselian valuation (in the language of rings). This is clearly not possible when the field is either separably or real closed, and, by the work of Prestel and Ziegler, there are further examples of henselian valued fields which do not admit a ∅-definable nontrivial henselian valuation. We give conditions on the residue field which ensure the existence of a parameter-free definition. In particular, we show that a henselian valued field admits a nontrivial henselian ∅-definable valuation when the residue field is separably closed or sufficiently nonhenselian, or when the absolute Galois group of the (residue) field is nonuniversal.

We develop Fraïssé theory, namely the theory of Fraïssé classes and Fraïssé limits, in the context of metric structures. We show that a class of finitely generated structures is Fraïssé if and only if it is the age of a separable approximately homogeneous structure, and conversely, that this structure is necessarily the unique limit of the class, and is universal for it.

We do this in a somewhat new approach, in which “finite maps up to errors” are coded by approximate isometries.

We study the computable structure theory of linear orders of size $\aleph _1 $ within the framework of admissible computability theory. In particular, we characterize which of these linear orders are computably categorical.

We study the computable structure theory of linear orders of size $\aleph _1 $ within the framework of admissible computability theory. In particular, we study degree spectra and the successor relation.

We analyze the strength of the existence of idempotent ultrafilters in higher-order reverse mathematics.

Let $\left( {{{\cal U}_{{\rm{idem}}}}} \right)$ be the statement that an idempotent ultrafilter on ℕ exists. We show that over $ACA_0^\omega$, the higher-order extension of ACA0, the statement $\left( {{{\cal U}_{{\rm{idem}}}}} \right)$ implies the iterated Hindman’s theorem (IHT) and we show that $ACA_0^\omega + \left( {{{\cal U}_{{\rm{idem}}}}} \right)$ is ${\rm{\Pi }}_2^1$-conservative over $ACA_0^\omega + IHT$ and thus over $ACA_0^ +$.

We give a valuation theoretic characterization for a real closed field to be recursively saturated. This builds on work in [9], where the authors gave such a characterization for κ-saturation, for a cardinal $\kappa \ge \aleph _0 $. Our result extends the characterization of Harnik and Ressayre [7] for a divisible ordered abelian group to be recursively saturated.

Let M be a C-minimal structure and T its canonical tree (which corresponds in an ultrametric space to the set of closed balls with radius different than ∞ ordered by inclusion). We present a description of definable locally constant functions f : M → T in C-minimal structures having a canonical tree with infinitely many branches at each node and densely ordered branches. This provides both a description of definable subsets of T in one variable and analogues of known results in algebraically closed valued fields.

We extend the construction of bad fields of characteristic zero to the case of arbitrary prescribed divisible green torsion.

We let R be an o-minimal expansion of a field, V a convex subring, and (R0,V0) an elementary substructure of (R,V). Our main result is that (R,V) considered as a structure in a language containing constants for all elements of R0 is model complete relative to quantifier elimination in R, provided that kR (the residue field with structure induced from R) is o-minimal. Along the way we show that o-minimality of kR implies that the sets definable in kR are the same as the sets definable in k with structure induced from (R,V). We also give a criterion for a superstructure of (R,V) being an elementary extension of (R,V).

This paper deals with the question whether the assumption that for every inaccessible cardinal κ there is a well-order of H(κ+) definable over the structure $\langle {\rm{H}}({\kappa ^ + }), \in \rangle$ by a formula without parameters is consistent with the existence of (large) large cardinals and failures of the GCH. We work under the assumption that the SCH holds at every singular fixed point of the ℶ-function and construct a class forcing that adds such a well-order at every inaccessible cardinal and preserves ZFC, all cofinalities, the continuum function, and all supercompact cardinals. Even in the absence of a proper class of inaccessible cardinals, this forcing produces a model of “V = HOD” and can therefore be used to force this axiom while preserving large cardinals and failures of the GCH. As another application, we show that we can start with a model containing an ω-superstrong cardinal κ and use this forcing to build a model in which κ is still ω-superstrong, the GCH fails at κ and there is a well-order of H(κ+) that is definable over H(κ+) without parameters. Finally, we can apply the forcing to answer a question about the definable failure of the GCH at a measurable cardinal.

We prove that it is relatively consistent with ZF + CH that there exist two models of cardinality $\aleph _2 $ such that the second player has a winning strategy in the Ehrenfeucht–Fraïssé-game of length ω1 but there is no σ-closed back-and-forth set for the two models. If CH fails, no such pairs of models exist.

In [1], Anscombe and Koenigsmann give an existential ∅-definition of the ring of formal power series F[[t]] in its quotient field in the case where F is finite. We extend their method in several directions to give general definability results for henselian valued fields with finite or pseudo-algebraically closed residue fields.

We study nonorthogonality of symmetric, regular types and show that it preserves generic stability and is an equivalence relation on the set of all generically stable, regular types. We prove that some of the nice properties from the stable context hold in general. In the case of strongly regular types we will relate to the global Rudin–Keisler order.

We classify, in a nontrivial amenable collection of functors, all 2-chains up to the relation of having the same 1-shell boundary. In particular, we prove that in a rosy theory, every 1-shell of a Lascar strong type is the boundary of some 2-chain, hence making the 1st homology group trivial. We also show that, unlike in simple theories, in rosy theories there is no upper bound on the minimal lengths of 2-chains whose boundary is a 1-shell.

This paper considers Henkin’s proof of completeness of classical first-order logic and extends its scope to the realm of algebraizable logics in the sense of Blok and Pigozzi. Given a propositional logic L (for which we only need to assume that it has an algebraic semantics and a suitable disjunction) we axiomatize two natural first-order extensions L∀m and L∀ and prove that the former is complete with respect to all models over algebras from , while the latter is complete with respect to all models over relatively finitely subdirectly irreducible algebras. While the first completeness result is relatively straightforward, the second requires non-trivial modifications of Henkin’s proof by making use of the disjunction connective. As a byproduct, we also obtain a form of Skolemization provided that the algebraic semantics admits regular completions. The relatively modest assumptions on the propositional side allow for a wide generalization of previous approaches by Rasiowa, Sikorski, Hájek, Horn, and others and help to illuminate the “essentially first-order” steps in the classical Henkin’s proof.