English
Related papers

Related papers: Residually Constructible Extensions

200 papers

Let $\mathfrak{g}$ be a Lie algebra, $E$ a vector space containing $\mathfrak{g}$ as a subspace. The paper is devoted to the \emph{extending structures problem} which asks for the classification of all Lie algebra structures on $E$ such…

Rings and Algebras · Mathematics 2014-07-01 A. L. Agore , G. Militaru

We give an elementary construction of a certain class of model structures. In particular, we rederive the Kan model structure on simplicial sets without the use of topological spaces, minimal complexes, or any concrete model of fibrant…

Category Theory · Mathematics 2017-08-29 Christian Sattler

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…

Logic · Mathematics 2012-07-25 Michael C. Laskowski

We consider expansions of o-minimal structures on the real field by collections of restrictions to the positive real line of the canonical Weierstrass products associated to sequences such as $(-n^s)_{n>0}$ (for $s>0$) and $(-s^n)_{n>0}$…

Logic · Mathematics 2020-09-09 Chris Miller , Patrick Speissegger

Let $E\supseteq F$ be a field extension and $M$ a graded Lie algebra of maximal class over $E$. We investigate the $F$-subalgebras $L$ of $M$, generated by elements of degree $1$. We provide conditions for $L$ being either ideally…

Rings and Algebras · Mathematics 2023-11-14 Marina Avitabile , Norberto Gavioli , Valerio Monti

It is well known that the classic {\L}o\'s-Tarski preservation theorem fails in the finite: there are first-order definable classes of finite structures closed under extensions which are not definable (in the finite) in the existential…

Logic in Computer Science · Computer Science 2020-10-27 Anuj Dawar , Abhisekh Sankaran

In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…

Logic · Mathematics 2024-12-11 Thierry Coquand , Henri Lombardi , Stefan Neuwirth

We study residually transcendental extensions of a valuation $v$ on a field $E$ to function fields of hyperelliptic curves over $E$. We show that $v$ has at most finitely many extensions to the function field of a hyperelliptic curve over…

Commutative Algebra · Mathematics 2025-07-15 Parul Gupta , Sumit Chandra Mishra

Suppose $F$ is a field with valuation $v$ and valuation ring $O_{v}$, $E$ is a finite field extension and $w$ is a quasi-valuation on $E$ extending $v$. We study quasi-valuations on $E$ that extend $v$; in particular, their corresponding…

Commutative Algebra · Mathematics 2013-01-23 Shai Sarussi

The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…

Logic · Mathematics 2020-05-13 Emil Jeřábek

In partial function extension, we are given a partial function consisting of $n$ points from a domain and a function value at each point. Our objective is to determine if this partial function can be extended to a function defined on the…

Data Structures and Algorithms · Computer Science 2018-12-17 Umang Bhaskar , Gunjan Kumar

Let $T$ be a complete, model complete o-minimal theory extending the theory of real closed ordered fields and assume that $T$ is power bounded. Let $K$ be a model of $T$ equipped with a $T$-convex valuation ring $\mathcal{O}$ and a…

Logic · Mathematics 2025-02-06 Elliot Kaplan , Nigel Pynn-Coates

Let U be a monster model and let D be a subset of U. Let (U,D) denote theexpansion of U with a new predicate for D. Write e(D) for the collection of all subsets C of U such that (U,C) is elementary equivalent to (U,D). We prove that if e(D)…

Logic · Mathematics 2015-08-21 Domenico Zambella

In this paper we try to find a computational interpretation for a strong form of extensionality, which we call "converse extensionality". Converse extensionality principles, which arise as the Dialectica interpretation of the axiom of…

Logic · Mathematics 2023-06-22 Benno van den Berg , Robert Passmann

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

Let $\mathbb{E}$ be the HNN-extension of a group $B$ with subgroups $H$ and $K$ associated according to an isomorphism $\varphi\colon H \to K$. Suppose that $H$ and $K$ are normal in $B$ and $(H \cap K)\varphi = H \cap K$. Under these…

Group Theory · Mathematics 2025-05-05 E. V. Sokolov , E. A. Tumanova

Proper classes of extensions of real field was defined and topological properties of these extensions were studied. These extensions can be connected, in this case such set is not closed under binary operations (addition and…

Logic · Mathematics 2025-06-19 E. V. Alexandrov

We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…

Logic in Computer Science · Computer Science 2007-05-23 Yves Bertot

A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…

Logic · Mathematics 2021-06-07 Athar Abdul-Quader , Roman Kossak

A notion of a coring extension is defined and it is related to the existence of an additive functor between comodule categories that factorises through forgetful functors. This correspondence between coring extensions and factorisable…

Rings and Algebras · Mathematics 2008-07-31 Tomasz Brzezinski