English
Related papers

Related papers: Neutrally Expandable Models of Arithmetic

200 papers

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

Logic · Mathematics 2023-02-17 Saharon Shelah , Alexander Usvyatsov

Let $K$ be a field. The \'etale open topology on the $K$-points $V(K)$ of a $K$-variety $V$ was introduced in our previous work. The \'etale open topology is non-discrete if and only if $K$ is large. If $K$ is separably, real, $p$-adically…

Logic · Mathematics 2022-11-22 Erik Walsberg , Jinhe Ye

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

Let $\alpha\geq 2$ be any ordinal. We consider the class $\mathsf{Drs}_{\alpha}$ of relativized diagonal free set algebras of dimension $\alpha$. With same technique, we prove several important results concerning this class. Among these…

Logic · Mathematics 2018-07-03 Amitayu Banerjee , Mohamed Khaled

Let $\omega$ be a differential 1-form defining an algebraic foliation of codimension 1 in projective space. In this article we use commutative algebra to study the singular locus of $\omega$ through its ideal of definition. Then, we expose…

Algebraic Geometry · Mathematics 2020-07-20 César Massri , Ariel Molinuevo , Federico Quallbrunn

We consider the problem of whether a given decision model, working with structured data, has individual fairness. Following the work of Dwork, a model is individually biased (or unfair) if there is a pair of valid inputs which are close to…

Machine Learning · Computer Science 2020-06-23 Philips George John , Deepak Vijaykeerthy , Diptikalyan Saha

Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…

Rings and Algebras · Mathematics 2023-01-31 Vesselin S. Drensky

If $\mathcal{C}$ is a category of algebras closed under finite direct products, and $M_\mathcal{C}$ the commutative monoid of isomorphism classes of members of $\mathcal{C},$ with operation induced by direct product, A.Tarski defined a…

Rings and Algebras · Mathematics 2026-04-28 George M. Bergman

We study a class of first-order theories whose complete quantifier-free types with one free variable either have a trivial positive part or are isolated by a positive quantifier-free formula--plus a few other technical requirements. The…

Logic · Mathematics 2009-06-01 Domenico Zambella

Let $\mathbb{Q}(\alpha)$ and $\mathbb{Q}(\beta)$ be linearly disjoint number fields and let $\mathbb{Q}(\theta)$ be their compositum. We prove that the first-degree prime ideals of $\mathbb{Z}[\theta]$ may almost always be constructed in…

Number Theory · Mathematics 2025-04-16 Giordano Santilli , Daniele Taufer

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

Logic · Mathematics 2023-10-04 Nikolaos Galatos , Gavin St. John

We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidability. We also obtain a…

Number Theory · Mathematics 2014-10-23 Alexandra Shlapentokh

The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…

Logic in Computer Science · Computer Science 2020-08-10 Fabian Zaiser , C. -H. Luke Ong

The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…

Optimization and Control · Mathematics 2022-10-21 Pavel Chebotarev

It is known that for subgraph-closed graph classes the first-order model checking problem is fixed-parameter tractable if and only if the class is nowhere dense [Grohe, Kreutzer, Siebertz, STOC 2014]. However, the dependency on the formula…

Logic in Computer Science · Computer Science 2025-05-28 Jakub Gajarský , Michał Pilipczuk , Marek Sokołowski , Giannos Stamoulis , Szymon Toruńczyk

After explaining the importance of model categories in abstract homotopy theory, we provide concrete examples demonstrating that various categories of manifolds do not have all finite colimits, and hence cannot be model categories. We then…

Algebraic Topology · Mathematics 2024-08-27 David White

We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They…

Discrete Mathematics · Computer Science 2015-03-23 Francesco Dolce , Dominique Perrin

We study open analytic curves over non-archimedian fields and their formal models. In particular, we give a criterion, in terms of etale cohomology, when such a formal model is (almost) semistable.

Algebraic Geometry · Mathematics 2007-05-23 Stefan Wewers

In this paper we study near vector spaces over a commutative $F$ from a model theoretic point of view. In this context we show regular near vector spaces are in fact vector spaces. We find that near vector spaces are not first order…

Logic · Mathematics 2022-07-12 Karin-Therese Howell , Charlotte Kestner

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
‹ Prev 1 8 9 10 Next ›