English
Related papers

Related papers: Generalized Indiscernibles as Model-complete Theor…

200 papers

The Whitney extension theorem is a classical result in analysis giving a necessary and sufficient condition for a function defined on a closed set to be extendable to the whole space with a given class of regularity. It has been adapted to…

Metric Geometry · Mathematics 2018-03-16 Nicolas Juillet , Mario Sigalotti

The purpose of this paper is to constructively develop a Galois theory on irreducible shifts of finite type (SFTs) and to analyze the automorphism groups of SFTs using this framework. Let $X$ and $Y$ be irreducible SFTs. We demonstrate that…

Dynamical Systems · Mathematics 2026-05-28 Kazutoyo Iketake

We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…

Logic · Mathematics 2020-11-11 Joel David Hamkins , Kameryn J. Williams

Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological Ramsey space is endowed with a partial ordering which can be modified to a $\sigma$-closed `almost…

Logic · Mathematics 2018-05-23 Natasha Dobrinen

Gromov asked what a typical (finitely presented) group looks like, and he suggested a way to make the question precise in terms of limiting density. The typical finitely generated group is known to share some important properties with the…

Logic · Mathematics 2022-09-12 Johanna N. Y. Franklin , Meng-Che "Turbo" Ho , Julia Knight

We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…

Logic · Mathematics 2025-12-16 J. B. Nation , Gianluca Paolini

In this paper we investigate the connections between Ramsey properties of Fraisse classes K and the universal minimal flow M(G_K) of the automorphism group G_K of their Fraisse limits. As an extension of a result of Kechris, Pestov and…

Logic · Mathematics 2014-04-25 Moritz Müller , András Pongrácz

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…

General Relativity and Quantum Cosmology · Physics 2023-10-24 Aristotelis Panagiotopoulos , George Sparling , Marios Christodoulou

Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…

Combinatorics · Mathematics 2023-09-14 Ann-Kathrin Elm , Hendrik Heine

We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…

Logic in Computer Science · Computer Science 2019-04-10 Wiesław Szwast , Lidia Tendera

We prove that the automorphism group of a Fra\"iss\'e structure M equipped with a notion of stationary independence is universal for the class of automorphism groups of substructures of M. Furthermore, we show that this applies to certain…

Logic · Mathematics 2015-01-20 Isabel Müller

We show that any pseudofinite group with NIP theory and with a finite upper bound on the length of chains of centralisers is soluble-by-finite. In particular, any NIP rosy pseudofinite group is soluble-by-finite. This generalises, and…

Logic · Mathematics 2012-02-16 Dugald Macpherson , Katrin Tent

Building on the work of Avraham, Rubin, and Shelah, we aim to build a variant of the Fra\"iss\'e theory for uncountable models built from finite submodels. With this aim, we generalize the notion of an increasing set of reals to other…

Logic · Mathematics 2023-07-18 Ziemowit Kostana

The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$…

Group Theory · Mathematics 2013-05-06 Mustafa Gokhan Benli , Rostislav Grigorchuk , Pierre De La Harpe

The outlines of a "Galois theory" for bimeromorphic geometry is here developed, via the study of model-theoretic definable binding groups in the theory CCM of compact complex spaces. As an application, a structure theorem about principal…

Logic · Mathematics 2025-12-15 Rahim Moosa , Anand Pillay

We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…

Classical Analysis and ODEs · Mathematics 2024-09-19 Vyacheslav M. Boyko , Oleksandra V. Lokaziuk , Roman O. Popovych

In this paper we provide purely categorical proofs of two important results of structural Ramsey theory: the result of M.\ Soki\'c that the free product of Ramsey classes is a Ramsey class and the result of M.\ Bodirsky, M.\Pinsker and T.\…

Category Theory · Mathematics 2023-01-18 Dragan Mašulović

By discussing several examples, the theory of generalized functional models is shown to be very natural for modeling some situations of reasoning under uncertainty. A generalized functional model is a pair (f, P) where f is a function…

Artificial Intelligence · Computer Science 2013-02-08 Paul-Andre Monney

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…

Computational Complexity · Computer Science 2007-05-23 Joerg Flum , Martin Grohe
‹ Prev 1 8 9 10 Next ›