Related papers: Combining Combination Properties: Minimal Models
We make two contributions to the study of theory combination in satisfiability modulo theories. The first is a table of examples for the combinations of the most common model-theoretic properties in theory combination, namely stable…
In the Nelson-Oppen combination method for satisfiability modulo theories, the combined theories must be stably infinite; in gentle combination, one theory has to be gentle, and the other has to satisfy a similar yet weaker property; in…
This work is a part of an ongoing effort to understand the relationships between properties used in theory combination. We here focus on including two properties that are related to shiny theories: the finite model property and stable…
The study of theory combination in Satisfiability Modulo Theories (SMT) involves various model theoretic properties (e.g., stable infiniteness, smoothness, etc.). We show that such properties can be partly captured by the natural density of…
We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…
We make two contributions to the study of polite combination in satisfiability modulo theories. The first contribution is a separation between politeness and strong politeness, by presenting a polite theory that is not strongly polite. This…
Shininess and strong politeness are properties related to theory combination procedures. In a paper titled "Many-sorted equivalence of shiny and strongly polite theories", Casal and Rasga proved that for decidable theories, these properties…
Broadly speaking, a finiteness property of groups is any generalisation of the property of having finite order. A large part of infinite group theory is concerned with finiteness properties and the relationships between them. Profinite…
We study compactness and L\"owenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary…
We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…
This paper provides a full characterization for when the expansion of a complete o-minimal theory by a unary predicate that picks out a divisible dense and codense subgroup has a model companion. This result is motivated by criteria and…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
The Satisfiability Modulo Theories (SMT) issue concerns the satisfiability of formulae from multiple background theories, usually expressed in the language of first-order predicate logic with equality. SMT solvers are often based on…
Three philosophical principles are often quoted in connection with Leibniz: "objects sharing the same properties are the same object" (Identity of indiscernibles), "everything can possibly exist, unless it yields contradiction" (Possibility…
Three philosophical principles are often quoted in connection with Leibniz: "objects sharing the same properties are the same object", "everything can possibly exist, unless it yields contradiction", "the ideal elements correctly determine…
We give Hennessy-Milner classes for intuitionistic, dual-intuitionistic and bi-intuitionistic logic interpreted in intuitionistic Kripke models, and generalise these results to modal (dual- and bi-)intuitionistic logics. Our main technical…
This paper presents some finite combinatorics of set systems with applications to model theory, particularly the study of dependent theories. There are two main results. First, we give a way of producing lower bounds on VC_ind-density, and…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
Since their introduction by G. Gr\"atzer and E. Knapp in 2007, more than four dozen papers have been devoted to finite slim planar semimodular lattices (in short, SPS lattices or slim semimodular lattices) and to some related fields. In…
Model merging combines knowledge from separately fine-tuned models, yet the factors driving its success remain poorly understood. While recent work treats mergeability as an intrinsic property of the models, we show with an…