English
Related papers

Related papers: Lovely pairs of models: the non first order case

200 papers

We consider convolution equations of the type f * T = g where f, g are in L^p(R^n) and T is a compactly supported distribution. Under natural assumptions on the zero set of the Fourier transform of T we show that f is compactly supported,…

Functional Analysis · Mathematics 2010-02-23 E. K. Narayanan , Amit Samanta

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…

Logic in Computer Science · Computer Science 2015-07-01 Luc Segoufin , Balder ten Cate

The theory of fields that are equipped with a countably infinite family of commuting derivations is not companionable; but if the axiom is added whereby the characteristic of the fields is zero, then the resulting theory is companionable.…

Logic · Mathematics 2013-03-28 Özcan Kasal , David Pierce

We show that for every positive integer $n$ there exists a simple group that is of type $\mathrm{F}_{n-1}$ but not of type $\mathrm{F}_n$. For $n\ge 3$ these groups are the first known examples of this kind. They also provide infinitely…

Group Theory · Mathematics 2018-10-23 Rachel Skipper , Stefan Witzel , Matthew C. B. Zaremsky

We prove that the automorphism group of a topological parallelism on real projective 3-space is compact. In a preceding article it was proved that at least the connected component of the identity is compact. The present proof does not…

Geometric Topology · Mathematics 2017-10-17 Löwen Rainer

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

We propose for the Effective Topos an alternative construction: a realisability framework composed of two levels of abstraction. This construction simplifies the proof that the Effective Topos is a topos (equipped with natural numbers),…

Logic in Computer Science · Computer Science 2013-07-16 Alexis Bernadet , Stéphane Graham-Lengrand

We explicitly present expansions of the complex field which are models of the theories of green points in the multiplicative group case and in the case of an elliptic curve without complex multiplication defined over $\mathbb{R}$. In fact,…

Logic · Mathematics 2014-01-15 Juan Diego Caycedo , Boris Zilber

We prove existence of flips, special termination, the base point free theorem and, in the case of log general type, the existence of minimal models for F-dlt foliated pairs of co-rank one on a $\mathbb Q$-factorial projective threefold. As…

Algebraic Geometry · Mathematics 2025-09-05 Paolo Cascini , Calum Spicer

We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…

Formal Languages and Automata Theory · Computer Science 2024-01-18 Juan Climent Vidal , Enric Cosme Llópez

We give several new equivalences of $NIP$ for formulas and new proofs of known results using [T87] and [HOR91]. We emphasize that Keisler measures are more complicated than types (even in $NIP$ context), in an analytic sense. Among other…

Logic · Mathematics 2024-08-28 Karim Khanaki

Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…

Algebraic Geometry · Mathematics 2022-11-23 James Freitag , Rémi Jaoui , Rahim Moosa

This paper establishes model-theoretic properties of $\mathrm{FOE}^{\infty}$, a variation of monadic first-order logic that features the generalised quantifier $\exists^\infty$ (`there are infinitely many'). We provide syntactically defined…

Logic in Computer Science · Computer Science 2018-09-11 Facundo Carreiro , Alessandro Facchini , Yde Venema , Fabio Zanasi

We find new "reasons" for a class of models for not having a universal model in a cardinal $\lambda$. This work, though it has consequences in model theory, is really in combinatorial set theory. We concentrate on a prototypical class which…

Logic · Mathematics 2022-03-15 Saharon Shelah

Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…

Logic in Computer Science · Computer Science 2015-03-17 Christoph Benzmueller

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

Logic · Mathematics 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-called context c. This leads to defining c-superstability, a…

Logic · Mathematics 2021-07-06 M. Malliaris , S. Shelah

We prove that for every prime $p$ algebraically clean graphs of groups are virtually residually $p$-finite and cohomologically $p$-complete. We also prove that they are cohomologically good. We apply this to certain $2$-dimensional Artin…

Group Theory · Mathematics 2023-12-27 Kasia Jankiewicz , Kevin Schreve

Let $T_P$ be the theory of beautiful pairs of algebraically closed fields of fixed characteristic. It is known that for real tuples in models of $T_P$, SU-rank coincides with Morley rank and can be computed effectively. Building on Pillay's…

Logic · Mathematics 2026-05-25 Zixuan Zhu
‹ Prev 1 8 9 10 Next ›