逻辑
Let M be the generic poset, defined as the Fra\"iss\'e limit of the class of finite posets. We show that every countably infinite poset A can be embedded with coinfinite image into M so that each automorphism of the image of A extends…
We introduce the fragility spectrum, a quantitative framework to measure the resilience of model-theoretic properties (e.g., stability, NIP, NTP$_2$, decidability) under language expansions. The core is the fragility index…
We establish that the complete theory of a Hilbert space equipped with a normal operator has the Schr\"oder-Bernstein property. This answers a question of Argoty, Berenstein, and the first-named author. We also prove an analogous statement…
In this short note we give some corollaries of the polynomial inverse function theorem for large fields. We prove inverse and implicit function theorems for Nash maps over large fields, characterize large fields as fields satisfying inverse…
We provide a rough sets semantics for the three-valued extension of first-order Priest's da Costa logic, which we studied in [Castiglioni, J.L. and Ertola-Biraben, R.C. Modalities combining two negations. {\em Journal of Logic and…
We present a dichotomy for structures $A$ that are preserved by primitive actions of $S_{\omega} = \text{Sym}({\mathbb N})$: such a structure primitively positively constructs all finite structures and the constraint satisfaction problem is…
We obtain a relatively simple criterion for when a forcing has the ${<}\,\delta$-approximation property, generalizing a result of Unger. Afterwards we apply this criterion to construct variants of Mitchell Forcing in order to answer…
We answer a question of Krueger by obtaining -- from countably many Mahlo cardinals -- a model where there is a disjoint stationary sequence on $\aleph_{n+2}$ for every $n\in\omega$. In that same model, the notions of being internally…
A note connecting arguments scattered in the extant literature proving that, in any o-minimal expansion of the real field, a definable family of sets has the property that the set of parameters corresponding to finite-volume fibers is…
Normal modal logics extending the logic K4.3 of linear transitive frames are known to lack the Craig interpolation property, except some logics of bounded depth such as S5. We turn this `negative' fact into a research question and pursue a…
This article provides examples of distal metric structures. One source of examples are metric valued fields. By analyzing indiscernible sequences, we show that real closed metric valued fields are distal, and conclude that algebraically…
We show that given a monadically stable theory $T$, a sufficiently saturated $\mathbf M \models T$, and a coherent system of probability measures on the $\sigma$-algebras generated by parameter-definable sets of $\mathbf M$ in each…
This note shows how recent work of Eskew and Hayut can be combined with a method of Raghavan and Shelah to show the consistency of $\mathfrak u_\kappa<2^\kappa$ for $\aleph_3\leq \kappa<\aleph_{\omega}$, from a huge cardinal.
Answering a question of Kaye, we show that the compositional truth theory with a full collection scheme is conservative over Peano Arithmetic. We demonstrate it by showing that countable models of compositional truth which satisfy the…
In this paper we give an ordinal analysis of a set theory with $\Pi_{N}$-Collection.
Propositional temporal logic over the real number time flow is finitely axiomatisable, but its first-order counterpart is not recursively axiomatisable. We study the logic that combines the propositional axiomatisation with the usual axioms…
We say that a Kripke model is a GL-model if the accessibility relation $\prec$ is transitive and converse well-founded. We say that a Kripke model is a D-model if it is obtained by attaching infinitely many worlds $t_1, t_2, \ldots$, and…
We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…
The Kruskal-Friedman theorem asserts: in any infinite sequence of finite trees with ordinal labels, some tree can be embedded into a later one, by an embedding that respects a certain gap condition. This strengthening of the original…
We develop a proof-theoretic semantics (P-tS) for second-order logic (S-oL), providing an inferentialist alternative to both full and Henkin model-theoretic interpretations. Our approach is grounded in base-extension semantics (B-eS), a…