Related papers: Preservation theorems for strong first-order logic…

We prove completeness, interpolation and omitting types for certain predicate topological logics that properly extend the first order case. We aslo count the non isomorphic topological models of a countable theory

The notions of generating sets of conservation laws of systems of differential equations with respect to symmetry groups and equivalence groups are introduced and applied. This allows us to generalize essentially the procedure of finding…

Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

We consider the cubic and quintic Gross-Pitaevskii (GP) hierarchies in $d$ dimensions, for focusing and defocusing interactions. We introduce new higher order energy functionals and prove that they are conserved for solutions of energy…

Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…

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.

We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our…

We identify a canonical structure J associated to any first-order theory, the {\it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple…

We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…

This is an exposition of the first two sections of Chapter VI of Shelah's book Proper and Improper Forcing. It covers various preservation theorems for CS iteration of proper forcing (omega-omega bounding, Sacks property, P-point property,…

We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…

We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…

We show that the notions of generic and Laver-generic supercompactness are first-order definable in the language of ZFC. This also holds for generic and Laver-generic (almost) hugeness as well as for generic versions of other large…

Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after,…

In this paper we show that forcings which are strongly proper for stationarily many countable elementary submodels preserve each of the following properties of topological spaces: countably tight; Lindel\"of; Rothberger; Menger; and a…

We consider a certain class of infinitary rules of inference, called here restriction rules, using of which allows us to deduce complete theories of given models. The first instance of such rules was the $\omega$-rule introduced by Hilbert,…

For a conformal vector field on a closed, real-analytic, Lorentzian manifold we prove that the flow is locally isometric -- that it preserves a metric in the conformal class on a neighborhood of any point -- or the metric is everywhere…

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…