English
Related papers

Related papers: Categoricity without Power

200 papers

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

Logic · Mathematics 2019-03-05 Jennifer Chubb , Russell Miller , Reed Solomon

Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…

Logic · Mathematics 2009-03-23 Saharon Shelah

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…

Logic · Mathematics 2007-05-23 Michael C. Laskowski , Saharon Shelah

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…

Logic · Mathematics 2012-06-20 Joel David Hamkins , David Linetsky , Jonas Reitz

A once-extended d-dimensional topological field theory Z is a symmetric monoidal functor (taking values in a chosen target symmetric monoidal (infty,2)-category) assigning values to (d-2)-manifolds, (d-1)-manifolds, and d-manifolds. We show…

Algebraic Topology · Mathematics 2018-06-13 Christopher Schommer-Pries

We investigate a notion called uniqueness in power kappa that is akin to categoricity in power kappa, but is based on the cardinality of the generating sets of models instead of on the cardinality of their universes. The notion is quite…

Logic · Mathematics 2016-09-06 Steven Givant , Saharon Shelah

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…

Logic · Mathematics 2025-02-04 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

There exists a dispute in philosophy, going back at least to Leibniz, whether is it possible to view the world as a network of relations and relations between relations with the role of objects, between which these relations hold, entirely…

Category Theory · Mathematics 2016-02-05 Michael Heller

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Logic · Mathematics 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

Category theory can be used to state formulas in First-Order Logic without using set membership. Several notable results in logic such as proof of the continuum hypothesis can be elegantly rewritten in category theory. We propose in this…

Logic in Computer Science · Computer Science 2022-04-19 Chan Le Duc

Given a cover $\mathbb{U}$ of a family of smooth complex algebraic varieties, we associate with it a class $\mathcal{U},$ containing $\mathbb{U}$, of structures locally definable in an o-minimal expansion of the reals. We prove that the…

Logic · Mathematics 2024-05-01 Boris Zilber

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

Logic · Mathematics 2016-02-02 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

The categoricity spectrum of a class of structures is the collection of cardinals in which the class has a single model up to isomorphism. Assuming that cardinal exponentiation is injective (a weakening of the generalized continuum…

Logic · Mathematics 2019-10-03 Sebastien Vasey

In the original version of this paper, we assume a theory $T$ that the logic $\mathbb L_{\kappa, \aleph_{0}}$ is categorical in a cardinal $\lambda > \kappa$, and $\kappa$ is a measurable cardinal. There we prove that the class of model of…

Logic · Mathematics 2024-03-05 Oren Kolman , Saharon Shelah

We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…

Logic · Mathematics 2024-03-22 Steffen Lempp , Yiqun Liu , Yong Liu , Keng Meng Ng , Cheng Peng , Guohua Wu

In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…

Logic · Mathematics 2018-12-04 Eddy El Khalil

Over an arbitrary field, we prove that the relative 2-Deligne tensor product of two separable module 2-categories over a compact semisimple tensor 2-category exists. This allows us to consider the Morita 4-category of compact semisimple…

Category Theory · Mathematics 2024-11-08 Thibault D. Décoppet

Let $R$ be a finite-dimensional algebra over an algebraically closed field $F$ graded by an arbitrary group $G$. We prove that $R$ is a graded division algebra if and only if it is isomorphic to a twisted group algebra of some finite…

Rings and Algebras · Mathematics 2007-05-23 Y. A. Bahturin , S. K. Sehgal , M. V. Zaicev

We develop the theory of exact completions of regular $\infty$-categories, and show that the $\infty$-categorical exact completion (resp. hypercompletion) of an abelian category recovers the connective half of its bounded (resp. unbounded)…

Category Theory · Mathematics 2023-10-20 Germán Stefanich