English
Related papers

Related papers: Inner mantles and iterated HOD

200 papers

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

Logic · Mathematics 2019-03-08 Philip Welch

We investigate iterating the construction of $C^{*}$, the $L$-like inner model constructed using first order logic augmented with the "cofinality $\omega$" quantifier. We first show that $\left(C^{*}\right)^{C^{*}}=C^{*}\ne L$ is…

Logic · Mathematics 2021-09-14 Ur Ya'ar

Recently, we have shown that satisfiability for $\mathsf{ECTL}^*$ with constraints over $\mathbb{Z}$ is decidable using a new technique. This approach reduces the satisfiability problem of $\mathsf{ECTL}^*$ with constraints over some…

Logic in Computer Science · Computer Science 2015-02-25 Claudia Carapelle , Shiguang Feng , Alexander Kartzow , Markus Lohrey

We show that the equational theory of the structure $\langle \omega^{\omega}: (x,y)\mapsto x+y, x\mapsto \omega x \rangle $ is finitely axiomatizable and give a simple axiom schema when the domain is the set of transfinite ordinals. We give…

Logic · Mathematics 2025-07-09 Christian Choffrut

In this expository paper, we mainly study orthogonal arrays (OAs) of strength two having a row that is repeated $m$ times. It turns out that the Plackett-Burman bound (\cite{PB}) can be strengthened by a factor of $m$ for orthogonal arrays…

Combinatorics · Mathematics 2018-12-14 Douglas R. Stinson

We prove that any countable support iteration formed with posets with $\omega_2$-p.i.c.\ has $\omega_2$-c.c., assuming CH in the ground model and assuming also that $\omega_1$ is not collapsed. This improves earlier results of Shelah by…

Logic · Mathematics 2016-09-07 Chaz Schlindwein

Let F be a fibration on a simply-connected base with symplectic fibre (M, \omega). Assume that the fibre is nilpotent and T^{2k}-separable for some integer k or a nilmanifold. Then our main theorem, Theorem 1.8, gives a necessary and…

Algebraic Topology · Mathematics 2011-08-04 Katsuhiko Kuribayashi

In the 1990s, Steel and Woodin showed that under large cardinal hypotheses, the HOD of $L(\mathbb R)$ admits a fine-structural analysis. Although this theorem sheds light on various problems in descriptive set theory, the fine-structural…

Logic · Mathematics 2026-03-24 Gabriel Goldberg , Grigor Sargsyan , Benjamin Siskind

Let $R$ be a commutative Noetherian local ring and $M,N$ be finitely generated $R$-modules. We prove a number of results of the form: if $\mbox{Hom}_R(M,N)$ has some nice properties and $\mbox{Ext}^{1 \leq i \leq n}_R(M,N)=0$ for some $n$,…

Commutative Algebra · Mathematics 2017-11-06 Hailong Dao , Mohammad Eghbali , Justin Lyle

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Logic · Mathematics 2023-11-09 Tim S. Lyon , Eugenio Orlandelli

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

Logic · Mathematics 2015-08-18 Borisa Kuzeljevic , Stevo Todorcevic

Assume the existence of sufficent large cardinals. Let $M_{\mathrm{sw}n}$ be the minimal iterable proper class $L[E]$ model satisfying "there are $\delta_0<\kappa_0<\ldots<\delta_{n-1}<\kappa_{n-1}$ such that the $\delta_i$ are Woodin…

Logic · Mathematics 2025-05-14 Grigor Sargsyan , Ralf Schindler , Farmer Schlutzenberg

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

Logic · Mathematics 2024-04-24 Miloš S. Kurilić

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

Logic · Mathematics 2007-05-23 Tomek Bartoszynski , Masaru Kada

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

We prove sharp results about recurrent behaviour of orbits of forward compositions of inner functions, inspired by fundamental results about iterates of inner functions, and give examples to illustrate behaviours that cannot occur in the…

Dynamical Systems · Mathematics 2024-05-21 Anna Miriam Benini , Vasiliki Evdoridou , Núria Fagella , Philip J. Rippon , Gwyneth M. Stallard

Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability for models of fragments of ${\rm ZFC}$,…

Logic · Mathematics 2013-11-27 Victoria Gitman , Thomas A. Johnstone

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Logic · Mathematics 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

A simple geometric construction on the moduli spaces $\mathcal{M}_{0,n}$ of curves of genus $0$ with $n$ ordered marked points is described which gives a common framework for many irrationality proofs for zeta values. This construction…

Number Theory · Mathematics 2014-12-22 Francis Brown

We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…

Information Theory · Computer Science 2013-12-18 Alexander Barg , Luciano V. Felix , Marcelo Firer , Marcos V. P. Spreafico