English
Related papers

Related papers: The elementary theory of Dedekind cuts in polynomi…

200 papers

Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…

Logic · Mathematics 2015-02-27 Manuel Bodirsky , Dugald Macpherson

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

General Mathematics · Mathematics 2014-12-30 Ramin Zahedi

We study and describe possibilities for arities of elementary theories and of their expansions. Links for arities with respect to Boolean algebras, to disjoint unions and to compositions of structures are shown. The dynamics for arities of…

Logic · Mathematics 2021-12-20 Sergey V. Sudoplatov

Non-archimedean fields with restricted analytic functions may not support a full exponential function, but they always have partial exponentials defined in convex subrings. On face of this, we study the first order theory of the class of…

Logic · Mathematics 2025-02-05 Leonardo Ángel , Xavier Caicedo

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

Logic · Mathematics 2018-04-18 Lars Kristiansen , Juvenal Murwanashyaka

The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…

Logic in Computer Science · Computer Science 2008-10-29 Dietrich Kuske , Markus Lohrey

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

Commutative Algebra · Mathematics 2025-11-11 Ezra Miller

Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…

Logic · Mathematics 2015-10-21 Levon Haykazyan

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

Logic · Mathematics 2014-02-26 G. O. Jones , A. J. Wilkie

A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…

Logic · Mathematics 2013-02-20 Saharon Shelah

We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open…

Logic · Mathematics 2022-06-08 Masato Fujita

The paper is devoted to construction of some closed inductive sequence of models of the generalized second-order Dedekind theory of real numbers with exponentially increasing powers. These models are not isomorphic whereas all models of the…

Logic · Mathematics 2019-07-08 Valeriy K. Zakharov , Timofey V. Rodionov

We introduce and study a natural class of fields in which certain first-order definable sets are existentially definable, and characterise this class by a number of equivalent conditions. We show that global fields belong to this class, and…

Logic · Mathematics 2023-06-22 Philip Dittmann , Dion Leijnse

Suppose that ${\mathcal M}$ is a model of PA and ${\mathcal N}$ is a countably generated elementary end extension of ${\mathcal M}$. Let ${\mathfrak X}$ be the set of subsets of M that are coded by ${\mathcal N}$. Then ${\mathcal M}$ has a…

Logic · Mathematics 2016-09-09 James H. Schmerl

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

Taking inspiration from [1, 21, 24], we develop a general framework to deal with the model theory of open incidence structures. In this first paper we focus on the study of systems of points and lines (rank $2$). This has a number of…

Logic · Mathematics 2024-12-03 Gianluca Paolini , Davide Emilio Quadrellaro

Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…

Commutative Algebra · Mathematics 2020-08-12 Ezra Miller

Let $\mathcal M=\langle M, <, +, \dots\rangle$ be an o-minimal expansion of an ordered group, and $P\subseteq M$ a dense set such that certain tameness conditions hold. We introduce the notion of a `product cone' in $\widetilde{\mathcal…

Logic · Mathematics 2017-08-15 Pantelis E. Eleftheriou

Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies…

Logic · Mathematics 2007-05-23 Rami Grossberg , Olivier Lessmann

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

Logic · Mathematics 2026-04-29 Hongyu Zhu