Related papers: Characterizing Sets of Theories That Can Be Disjoi…
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…
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…
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 is a part of an ongoing research project, with the aim of finding the connections between properties related to theory combination in Satisfiability Modulo Theories. In previous work, 7 properties were analyzed: convexity, stable…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
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 review the notion of (finitary) filter pair as a tool for creating and analyzing logics. A filter pair can be seen as a presentation of a logic, given by presenting its lattice of theories as the image of a lattice homomorphism, with…
We prove a Galois-type correspondence between compositions of purely inseparable field extensions (including infinite ones) and subalgebras of differential operators. This correspondence can be utilized to establish a connection between…
A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…
We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…
A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…
For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient…
We make further observations on the features of Galois cohomology in the general model theoretic context. We make explicit the connection between forms of definable groups and first cohomology sets with coefficients in a suitable…
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 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.…
Apart from a few remarks on lattice systems with global or gauge symmetries, most of this talk is devoted to some interesting ancient examples of symmetries and their breakdowns in elasticity theory and hydrodynamics. Since Galois Theory is…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and…