English
Related papers

Related papers: Taking model-complete cores

200 papers

We give algebraic conditions about a finite algebra $B$ over a perfect field of positive characteristic, which are equivalent to the companionability of the theory of fields with "$B$-operators" (i.e. the operators coming from homomorphisms…

Logic · Mathematics 2019-05-16 Özlem Beyarslan , Daniel Max Hoffmann , Moshe Kamensky , Piotr Kowalski

This paper deals with the class of existentially closed models of fields with a distinguished submodule (over a fixed subring). In the positive characteristic case, this class is elementary and was investigated by the first-named author.…

Logic · Mathematics 2022-09-20 Christian d'Elbée , Itay Kaplan , Leor Neuhauser

Geometrical stability theory is a powerful set of model-theoretic tools that can lead to structural results on models of a simple first-order theory. Typical results offer a characterization of the groups definable in a model of the theory.…

Logic · Mathematics 2007-05-23 Steven Buechler , Olivier Lessmann

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…

Formal Languages and Automata Theory · Computer Science 2023-01-31 Mikołaj Bojańczyk , Amina Doumane

We study the topology of a class of proper submodules and some of its distinguished subclasses and call them structure spaces. We give several criteria for the quasi-compactness of these structure spaces. We study $T_0$ and $T_1$ separation…

Rings and Algebras · Mathematics 2023-04-18 Amartya Goswami

We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…

Combinatorics · Mathematics 2024-06-24 Manuel Bodirsky , Colin Jahel

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

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 describe a category, the objects of which may be viewed as models for homotopy theories. We show that for such models, ``functors between two homotopy theories form a homotopy theory'', or more precisely that the category of such models…

Algebraic Topology · Mathematics 2008-12-05 Charles Rezk

In this paper, a Gaifman-Shapiro-style module architecture is tailored to the case of Smodels programs under the stable model semantics. The composition of Smodels program modules is suitably limited by module conditions which ensure the…

Artificial Intelligence · Computer Science 2008-09-29 Emilia Oikarinen , Tomi Janhunen

It is shown that finite-index extensions and finite-index subgroups of $\omega$-stable groups can be model-theoretically wild. More precisely, there exists an $\omega$-stable group $G$ such that any given countable first-order structure in…

Logic · Mathematics 2026-05-15 Yatir Halevi , Saharon Shelah

Given a first-order theory and a proof that it is consistent, can we design a proof-search method for this theory that fails in finite time when it attempts to prove the formula False?

Logic in Computer Science · Computer Science 2023-05-18 Gilles Dowek

Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…

Logic · Mathematics 2015-02-27 Manuel Bodirsky , Dugald Macpherson

In a many-to-one matchingmodel with responsive preferences in which indifferences are allowed, we study three notions of core, three notions of stability, and their relationships. We show that (i) the core contains the stable set, (ii) the…

Theoretical Economics · Economics 2022-03-31 Agustín G. Bonifacio , Noelia Juarez , Pablo Neme , Jorge Oviedo

This paper is devoted to the first-order theory of torsion-free hyperbolic groups. One of its purposes is to review some results and to provide precise and correct statements and definitions, as well as some proofs and new results. A key…

Group Theory · Mathematics 2020-07-29 Vincent Guirardel , Gilbert Levitt , Rizos Sklinos

We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…

Logic in Computer Science · Computer Science 2021-12-15 Yannick Forster , Dominik Kirst , Dominik Wehr

The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent…

Combinatorics · Mathematics 2016-08-16 Frantisek Kardos , Daniel Kral , Anita Liebenau , Lukas Mach

This paper is the first in a series whose goal is to develop a fundamentally new way of constructing theories of physics. The motivation comes from a desire to address certain deep issues that arise when contemplating quantum theories of…

Quantum Physics · Physics 2008-11-26 A. Doering , C. J. Isham

A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…

Logic · Mathematics 2026-01-06 Maciej Malicki