English
Related papers

Related papers: On model completion of T_{aut}

200 papers

Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…

Logic · Mathematics 2024-11-14 Fornasiero Antongiulio , Terzo Giuseppina

Motivated by structural properties of differential field extensions, we introduce the notion of a theory $T$ being derivation-like with respect to another model complete theory $T_0$. We prove that when $T$ admits a model companion $T_+$,…

Logic · Mathematics 2025-03-25 Omar Leon Sanchez , Shezad Mohamed

We prove that in a theory $T$ stable over a predicate $P$, for any $\lambda > |T|$, there is a $\lambda$-prime model over any complete set A with a $\lambda$-saturated $P$-part.

Logic · Mathematics 2024-01-04 Alexander Usvyatsov

We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…

Logic in Computer Science · Computer Science 2022-08-16 Yasha Savelyev

We study expansions of Hilbert spaces with a bounded normal operator $T$. We axiomatize this theory in a natural language and identify all of its completions. We prove the definability of the adjoint $T^*$ and prove quantifier elimination…

Logic · Mathematics 2025-07-30 Alexander Berenstein , Nicolás Cuervo Ovalle , Isaac Goldbring

We show that for any $n\geq 3$ the theory of open generalized $n$-gons is complete, decidable and strictly stable, yielding a new class of examples in the zoo of stable theories.

Logic · Mathematics 2023-10-03 Anna-Maria Ammer , Katrin Tent

In this paper we prove a strong nonstructure theorem for kappa (T)-saturated models of a stable theory T with dop.

Logic · Mathematics 2009-09-25 Tapani Hyttinen , Saharon Shelah

We generalize the Unstable Formula Theorem characterization of stable theories from \citep{sh78}: that a theory $T$ is stable just in case any infinite indiscernible sequence in a model of $T$ is an indiscernible set. We use a generalized…

Logic · Mathematics 2013-03-15 Lynn Scow

We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…

Logic · Mathematics 2026-05-07 Alexander Usvyatsov

For a theory $T$ in $L, T_\sigma$ is the theory of the models of $T$ with an automorphism $\sigma$. If $T$ is an unstable model complete theory without the independence property, then $T_\sigma$ has no model companion. If $T$ is an unstable…

Logic · Mathematics 2007-05-23 Hirotaka Kikyo

For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…

Logic · Mathematics 2024-03-20 Sergei Artemov

Let T be a complete first order theory in a countable relational language L . We assume relation symbols have been added to make each formula equivalent to a predicate. Adjoin a new unary function symbol sigma to obtain the language…

Logic · Mathematics 2007-05-23 John Baldwin , Saharon Shelah

We give another proof of a theorem of Hatcher and Vogtmann stating that the sequence $Aut(F_n)$ satisfies integral homological stability. The paper is for the most part expository, and we also explain Quillen's method for proving…

Geometric Topology · Mathematics 2015-08-18 Mladen Bestvina

In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…

Logic · Mathematics 2009-06-18 Moran Cohen , Saharon Shelah

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

Logic · Mathematics 2012-02-28 Saharon Shelah

The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…

Logic · Mathematics 2026-01-01 Karim Khanaki , Massoud Pourmahdian

Efficient computability is an important property of solution concepts in matching markets. We consider the computational complexity of finding and verifying various solution concepts in trading networks-multi-sided matching markets with…

Computational Complexity · Computer Science 2025-10-03 Tamás Fleiner , Zsuzsanna Jankó , Ildikó Schlotter , Alexander Teytelboym

Consider the expansion $T_S$ of a theory $T$ by a predicate for a submodel of a reduct $T_0$ of $T$. We present a setup in which this expansion admits a model companion $TS$. We show that the nice features of the theory $T$ transfer to…

Logic · Mathematics 2019-11-01 Christian d'Elbée

In this paper, we study properties and patterns on permutations of multisets whose multivariate generating functions are symmetric. We interpret this phenomenon through the lens of group actions and define such a property or pattern as…

Combinatorics · Mathematics 2026-02-17 Shaoshi Chen , Hanqian Fang , Sergey Kitaev

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

Logic · Mathematics 2025-12-25 Manuel Bodirsky , Bertalan Bodor , Paolo Marimon
‹ Prev 1 2 3 10 Next ›