English
Related papers

Related papers: On uncountable hypersimple unidimensional theories

200 papers

We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are…

Logic in Computer Science · Computer Science 2024-02-14 Peter Habermehl , Dietrich Kuske

A topological space is iso-dense if it has a dense set of isolated points. A topological space is scattered if each of its non-empty subspaces has an isolated point. In $\mathbf{ZF}$, in the absence of the axiom of choice, basic properties…

General Topology · Mathematics 2021-01-11 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…

Logic · Mathematics 2023-08-09 Nadav Meir

We prove that there are no pseudoholomorphic theories of anything other than curves, even if one allows more general spaces than almost complex manifolds. The proof is elementary, except for theories of pseudoholomorphic hypersurfaces,…

Differential Geometry · Mathematics 2010-09-29 Benjamin McKay

We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $\theta$ there is a dependent theory $T$ of size $\theta$ such that for all $\kappa$ and $\delta$,…

Logic · Mathematics 2013-08-29 Itay Kaplan , Saharon Shelah

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Group Theory · Mathematics 2026-03-30 Alexey Talambutsa

We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected…

Logic in Computer Science · Computer Science 2024-04-24 Roman Kontchakov , Yavor Nenov , Ian Pratt-Hartmann , Michael Zakharyaschev

We develop the theory of locally small spaces in a new simple language and apply this simplification to re-build the theory of locally definable spaces over structures with topologies.

General Topology · Mathematics 2020-09-08 Artur Piękosz

We will prove bi-interpretability of the arithmetic $\N = \langle N, +,\cdot, 0, 1\rangle$ and the weak second order theory of $\N$ with the free monoid $\mathbb{M}_X$ of finite rank greater than 1 and with a non-trivial partially…

Logic · Mathematics 2019-03-28 Olga Kharlampovich , Laura Lopez

We study the universal cover of the complex one-dimensional torus as a model-theoretic structure in a natural language. We consider also abstract covers of one-dimensional tori over algebraically closed fields of characteristic zero. The…

Commutative Algebra · Mathematics 2007-05-23 B. Zilber

We show that any countable model of a model complete theory has an elementary extension with a "pseudofinite-like" quasidimension that detects dividing.

Logic · Mathematics 2014-10-15 Isaac Goldbring , Henry Towsner

In this paper we study an N=1 supersymmetric extension of a perturbatively super-renormalizable (nonlocal)theory of gravity in four dimensions. The nonlocal supergravity theory is power-counting super-renormalizable and tree level unitary…

High Energy Physics - Theory · Physics 2012-06-14 Leonardo Modesto

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…

Operator Algebras · Mathematics 2016-05-06 Martino Lupini

The question whether an ontology can safely be replaced by another, possibly simpler, one is fundamental for many ontology engineering and maintenance tasks. It underpins, for example, ontology versioning, ontology modularization,…

Artificial Intelligence · Computer Science 2018-04-24 Elena Botoeva , Boris Konev , Carsten Lutz , Vladislav Ryzhikov , Frank Wolter , Michael Zakharyaschev

Although Berkovich spaces may fail to be metrizable when defined over too big a field, we prove that a large part of their topology can be recovered through sequences: for instance, limit points of subsets are actual limits of sequences and…

Algebraic Geometry · Mathematics 2012-12-17 Jérôme Poineau

We show that finite-dimensional Lie algebras over a field of characteristic zero such that their high-degree cohomology in any finite-dimensional non-trivial irreducible module vanishes, are, essentially, direct sums of semisimple and…

Rings and Algebras · Mathematics 2009-06-06 Pasha Zusmanovich

We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant relation or…

Logic in Computer Science · Computer Science 2018-09-11 Marcin Przybyłko

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

Computational Complexity · Computer Science 2010-06-29 Nadia Creignou , Johannes Schmidt , Michael Thomas

For any subset $Z \subseteq \mathbb{Q}$, consider the set $S_Z$ of subfields $L\subseteq \overline{\mathbb{Q}}$ which contain a co-infinite subset $C \subseteq L$ that is universally definable in $L$ such that $C \cap \mathbb{Q}=Z$. Placing…

Number Theory · Mathematics 2023-10-30 Kirsten Eisentraeger , Russell Miller , Caleb Springer , Linda Westrick

A distinction is sometimes made between "statistical" and "subjective" probabilities. This is based on a distinction between "unique" events and "repeatable" events. We argue that this distinction is untenable, since all events are "unique"…

Artificial Intelligence · Computer Science 2013-04-11 Henry E. Kyburg