English
Related papers

Related papers: Computable Axiomatizability of Elementary Classes

200 papers

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…

Logic · Mathematics 2025-02-05 Alexander Van Abel

Arguments on PL,(=piecewise linear) topology work over any ordered field in the same way as over the real field, and those on differential topology do over a real closed field R in an o-minimal structure that expands (R,<,0,1,+,cdot). One…

Logic · Mathematics 2010-02-17 Masahiro Shiota

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.

Logic · Mathematics 2026-05-12 Leonardo N. Coregliano , Maryanthe Malliaris

We show that the class of $\mathcal{L}$-constructible functions is closed under integration for any $P$-minimal expansion of a $p$-adic field $(K,\mathcal{L})$. This generalizes results previously known for semi-algebraic and sub-analytic…

Logic · Mathematics 2015-02-24 Pablo Cubides Kovacsics , Eva Leenknegt

We show quantifier elimination theorems for real closed valued fields with separated analytic structure and overconvergent analytic structure in their natural one-sorted languages and deduce that such structures are weakly o-minimal. We…

Logic · Mathematics 2020-02-19 Pablo Cubides Kovacsics , Deirdre Haskell

We show that for 1<n<m, the class Nr_nCA_m known to be non-elementary is pseudo elementary. When n and m are finite we use a two sorted theory, when n is finite and m infinite we use a three sorted one, and finally when both are infinite we…

Logic · Mathematics 2013-04-11 Tarek Sayed Ahmed

Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…

General Mathematics · Mathematics 2016-02-11 Giuseppe Raguní

We show that, for a certain large class of power-bounded $o$-minimal $\mathcal{L}_T$-theories $T$ whose field of exponents is infinite-dimensional as a vector space over the rationals, any definable set in a $T$-convex valued field…

Logic · Mathematics 2018-12-11 Yimu Yin

We prove that any definable family of subsets of a definable infinite set $A$ in an o-minimal structure has cardinality at most $|A|$. We derive some consequences in terms of counting definable types and existence of definable topological…

Logic · Mathematics 2023-06-05 Pablo Andújar Guerrero

For any abstract elementary class (AEC) ${\bf K}$ with $\lambda=LS({\bf K})$, the following holds: 1. $K$ has an axiomatization in $L_{(2^\lambda)^+,\lambda^+}$, allowing game quantification. If ${\bf K}$ has arbitrarily large models, the…

Logic · Mathematics 2023-02-06 Samson Leung

We let R be an o-minimal expansion of a field, V a convex subring, and $(R_0, V_{0})$ an elementary substructure of (R,V). We let L be the language consisting of a language for R, in which R has elimination of quantifiers, and a predicate…

Logic · Mathematics 2013-12-09 Clifton Ealy , Jana Maříková

We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…

Logic · Mathematics 2026-03-30 Su Gao , André Nies , Gianluca Paolini

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

Number Theory · Mathematics 2019-07-30 Peter Müller

Let $\mathcal{V}$ be a congruence permutable variety generated by a finite nilpotent algebra $\mathbf{A}$. If $\mathbf{A}$ is a product of algebras of prime power order, then the class $\mathcal{V}_\text{si}$ of subdirectly irreducible…

Logic · Mathematics 2023-09-01 Joshua Grice

Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that…

Logic · Mathematics 2012-11-19 Tomasz Gogacz , Krzysztof Krupinski

Let $R$ be an o-minimal expansion of a group in a language in which $\textrm{Th}(R)$ eliminates quantifiers, and let $C$ be a predicate for a valuational cut in $R$. We identify a condition that implies quantifier elimination for…

Logic · Mathematics 2020-07-17 Clifton Ealy , Jana Maříková

We generalize a recent result of Clausen: For a number field with integers O, we compute the K-theory of locally compact O-modules. For the rational integers this recovers Clausen's result as a special case. Our method of proof is quite…

K-Theory and Homology · Mathematics 2017-10-31 Oliver Braunling

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

We introduce and discuss a definition of approximation of a topological algebraic system $A$ by finite algebraic systems of some class $\K$. For the case of a discrete algebraic system this definition is equivalent to the well-known…

Logic · Mathematics 2007-05-23 L. Yu. Glebsky , E. I. Gordon , C. W. Henson