English
Related papers

Related papers: Model Theory of the Inaccessibility Scheme

200 papers

In [8] the second and third authors showed that if the least inaccessible cardinal is the least measurable cardinal, then there is an inner model with $o(\kappa)\geq2$. In this paper we improve this to $o(\kappa)\geq\kappa+1$ and show that…

Logic · Mathematics 2024-12-17 Moti Gitik , Yair Hayut , Asaf Karagila

We show that for a number of theories $T^*$ of model-theoretic interest there is a simpler theory $T$ and $\kappa \ge \aleph_0$ such that $T^*$ is trace equivalent to the theory of $\kappa$-dimensional space over a model of $T$.

Logic · Mathematics 2026-05-13 Erik Walsberg

In this paper we introduce a tree-like forcing notion extending some properties of the random forcing in the context of the generalised Cantor space and study its associated ideal of null sets and notion of measurability. This issue was…

Logic · Mathematics 2020-04-28 Sy David Friedman , Giorgio Laguzzi

The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M…

Logic · Mathematics 2012-05-07 Ioannis Souldatos

Throughout, $T$ denotes a complete first-order theory in a countable language $L$ that has infinite models and $I(\aleph_0,T)$ denotes the number of countable models of $T$, up to an isomorphism. To determine $I(\aleph_0,T)$, it suffices to…

Logic · Mathematics 2025-08-12 Anand Pillay , Predrag Tanović

We give an example of a countable theory T such that for every cardinal lambda >= aleph_2 there is a fully indiscernible set A of power lambda such that the principal types are dense over A, yet there is no atomic model of T over A. In…

Logic · Mathematics 2008-02-03 Michael C. Laskowski , Saharon Shelah

Does the class of linear orders have (one of the variants of) the so called (lambda, kappa)-limit model? It is necessarily unique, and naturally assuming some instances of G.C.H. we get some positive, i.e. existence results. More generally,…

Logic · Mathematics 2017-08-08 Saharon Shelah

A model with a sequence of indiscernibles depending on a particular precovering set is constructed.The initial assumption is as follows: for every n<omega the set {alpha | o(alpha)=alpha^+n } is unbounded in kappa.

Logic · Mathematics 2008-02-03 Moti Gitik

In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…

Logic · Mathematics 2025-11-18 J. B. Nation , Gianluca Paolini

We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…

Logic · Mathematics 2021-07-02 Pierre Simon

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

Logic · Mathematics 2017-02-23 Matthew Harrison-Trainor

We to a large extent sort out when does a (first order complete theory) T have a superlimit model in a cardinal lambda . Also we deal with relation notions of being limit.

Logic · Mathematics 2017-08-18 Saharon Shelah

We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…

Logic · Mathematics 2024-02-22 Jouko Vaananen , Boban Velickovic

We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…

Logic in Computer Science · Computer Science 2014-07-15 Hubie Chen

An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…

Logic · Mathematics 2012-05-21 Laura Fontanella

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

Logic · Mathematics 2012-11-28 Mohammad Assem

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

Logic · Mathematics 2023-06-22 Oleg Kudinov , Victor Selivanov

We study several cardinal, and ordinal--valued functions that are relatives of Hanf numbers. Let kappa be an infinite cardinal, and let T subseteq L_{kappa^+, omega} be a theory of cardinality <= kappa, and let gamma be an ordinal >=…

Logic · Mathematics 2016-09-07 Rami Grossberg , Saharon Shelah

For an arbitrary infinite cardinal $\kappa$, we define classes of coordinatewise $\kappa$-slender and tailwise $\kappa$-slender modules as well as related classes of $h\kappa$-modules and initiate a study of these classes.

Rings and Algebras · Mathematics 2017-07-12 Radoslav Dimitric

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

Logic · Mathematics 2008-07-08 Saharon Shelah
‹ Prev 1 2 3 10 Next ›