English
Related papers

Related papers: OD elements of countable OD sets in the Solovay mo…

200 papers

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…

Logic · Mathematics 2018-12-07 Miloš S. Kurilić

We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be…

Number Theory · Mathematics 2013-09-04 Christian Elsholtz , Adam J. Harper

We describe the ind- and pro- categories of the category of definable sets, in some first order theory, in terms of points in a sufficiently saturated model.

Logic · Mathematics 2009-08-05 Moshe Kamensky

We develop a theory of real numbers as rational Cauchy sequences, in which any two of them, $(a_n)$ and $(b_n)$, are equal iff $\lim\,(a_n-b_n)=0$. We need such reals in the Countable Mathematical Analysis ([4]) which allows to use only…

Logic · Mathematics 2023-08-10 Martin Klazar

The group configuration in o-minimal structures gives rise, just like in the stable case, to a transitive action of a type-definable group on a partial type. Because $acl=dcl$ the o-minimal proof is significantly simpler than Hrushovski's…

Logic · Mathematics 2020-06-01 Ya'acov Peterzil

The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…

Logic · Mathematics 2013-05-01 Uri Andrews , Isaac Goldbring , H. Jerome Keisler

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

Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…

Logic · Mathematics 2014-02-27 Eliana Barriga , Alf Onshuus , Charles Steinhorn

We introduce a non real-valued measure on the definable sets contained in the finite part of a cartesian power of an o-minimal field $R$. The measure takes values in an ordered semiring, the Dedekind completion of a quotient of $R$. We show…

Logic · Mathematics 2014-04-29 Jana Maříková , Masahiro Shiota

For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…

Number Theory · Mathematics 2020-04-23 D. Dakota Blair , Joel David Hamkins , Kevin O'Bryant

Cantor's famous proof of the non-denumerability of real numbers does apply to any infinite set. The set of exclusively all natural numbers does not exist. This shows that the concept of countability is not well defined. There remains no…

General Mathematics · Mathematics 2009-09-29 W. Mueckenheim

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

In this paper we completely characterize solvable real Lie groups definable in o-minimal expansions of the real field.

Logic · Mathematics 2015-06-29 Annalisa Conversano , Alf Onshuus , Sergei Starchenko

In constructive set theory, an ordinal is a hereditarily transitive set. In homotopy type theory (HoTT), an ordinal is a type with a transitive, wellfounded, and extensional binary relation. We show that the two definitions are equivalent…

Logic in Computer Science · Computer Science 2023-08-15 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

The objective of this study is a better understanding of the relationships between reduction and continuity. Solovay reduction is a variation of Turing reduction based on the distance of two real numbers. We characterize Solovay reduction…

Logic · Mathematics 2019-03-21 Masahiro Kumabe , Kenshi Miyabe , Yuki Mizusawa , Toshio Suzuki

In this paper we give an ordinal analysis of a set theory extending ${\sf KP}\ell^{r}$ with an axiom stating that `there exists a transitive set $M$ such that $M\prec_{\Sigma_{1}}V$'.

Logic · Mathematics 2024-08-08 Toshiyasu Arai

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

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Group Theory · Mathematics 2021-09-14 Grechkoseeva Mariya

Let $G$ be a finite group and $K$ a normal subset consisting of odd-order elements. The rational closure of $K$, denoted $\mathbf D_K$, is the set of elements $x \in G$ with the property that $\langle x \rangle = \langle y \rangle$ for some…

Group Theory · Mathematics 2025-07-11 Chris Parker , Jack Saunders

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Logic · Mathematics 2021-09-21 Michael C. Laskowski , Douglas S. Ulrich
‹ Prev 1 4 5 6 7 8 10 Next ›