English
Related papers

Related papers: Neutrally Expandable Models of Arithmetic

200 papers

We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that is defined by a formula with quantifier prefix…

Logic in Computer Science · Computer Science 2023-04-11 Isolde Adler , Noleen Köhler , Pan Peng

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt

Let $T$ be an o-minimal theory expanding $\mathrm{RCF}$ and $T_\mathrm{convex}$ be the common theory of its models expanded by predicate for a non-trivial $T$-convex valuation ring. We call an elementary extension $(\mathbb{E}, \mathcal{O})…

Logic · Mathematics 2026-02-09 Pietro Freni , Angus Matthews

We introduce and study soficity for Lie algebras, modelled after linear soficity in associative algebras. We introduce equivalent definitions of soficity, one involving metric ultraproducts and the other involving almost representations. We…

Rings and Algebras · Mathematics 2022-03-14 Cameron Cinel

We give sufficient conditions, in terms of the existence of unbounded derivations satisfying certain properties, which ensure that a II$_1$ factor $M$ is prime or has at most one Cartan subalgebra. For instance, we prove that if there…

Operator Algebras · Mathematics 2013-01-01 Yoann Dabrowski , Adrian Ioana

We show that for 1<n<m, the class Nr_nCA_m known to be non-elementary is pseudo elementary. When n and m are finite we use a two sorted theory, when n is finite and m infinite we use a three sorted one, and finally when both are infinite we…

Logic · Mathematics 2013-04-11 Tarek Sayed Ahmed

The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…

Logic in Computer Science · Computer Science 2023-06-22 Anuj Dawar , Eryk Kopczyński

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

Logic · Mathematics 2011-05-16 Alexandra Shlapentokh , Carlos Videla

A countable structure is said to be extendible if it has the same Scott sentence as some uncountable structure. Rigid structures are not extendible. We give an example of an extendible model with a rigid elementary extension.

Logic · Mathematics 2017-11-29 Paul B. Larson , Saharon Shelah

A model with a sequence of indiscernibles depending on a particular precovering set is constructed.The initial assumption is as follows: for every n<omega the set {alpha | o(alpha)=alpha^+n } is unbounded in kappa.

Logic · Mathematics 2008-02-03 Moti Gitik

We study monotone skew-product semiflows generated by families of nonautonomous neutral functional differential equations with infinite delay and stable D-operator, when the exponential ordering is considered. Under adequate hypotheses of…

Dynamical Systems · Mathematics 2024-02-02 Sylvia Novo , Rafael Obaya , Víctor M. Villarragut

We look at equivalence relations on the set of models of a theory -- MERs, for short -- such that the class of equivalent pairs is itself an elementary class, in a language appropriate for pairs of models. We provide many examples of…

Logic · Mathematics 2025-07-24 Michael Benedikt , Ehud Hrushovski

We study mappings that satisfy the inverse Poletsky inequality in a domain of the Euclidean space. Under certain conditions on the definition and mapped domains, it is established that they have a continuous extension to the boundary in…

Complex Variables · Mathematics 2022-11-10 Evgeny Sevost'yanov

In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…

Logic · Mathematics 2018-12-04 Eddy El Khalil

We prove that bold N, the standard model of arithmetic, has an uncountable elementary extension N such that there is no ultrafilter on the Boolean Algebra of subsets of bold N represented in N which is minimal (i.e. as in Rudin-Keisler…

Logic · Mathematics 2018-01-16 Saharon Shelah

We give sufficient conditions for a first order expansion of the real line to define the standard model of the monadic second order theory of one successor. Such an expansion does not satisfy any of the combinatorial tameness properties…

Logic · Mathematics 2016-12-07 Philipp Hieronymi , Erik Walsberg

We show how to build primes models in classes of saturated models of abstract elementary classes (AECs) having a well-behaved independence relation: $\mathbf{Theorem.}$ Let $K$ be an almost fully good AEC that is categorical in $\text{LS}…

Logic · Mathematics 2018-01-12 Sebastien Vasey

The starting point of this work is that the class of evolution algebras over a fixed field is closed under tensor product. This arises questions about the inheritance of properties from the tensor product to the factors and conversely. For…

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

Logic · Mathematics 2019-01-29 Saharon Shelah

We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a…

Logic in Computer Science · Computer Science 2019-03-14 Simon Castellan , Pierre Clairambault , Peter Dybjer