Related papers: Stable first order theories as simplicial profinit…
We give several new characterizations of $IP$ (the independence property) and $SOP$ (the strict order property) for continuous first order logic and study their relations to the function theory and the Banach space theory. We suggest new…
In this series of three papers, we introduce and study cyclotomic pairs and smooth profinite groups. They are a geometric axiomatisation of Kummer theory for fields, with coefficients $p$-primary roots of unity, for a prime $p$. These…
Modern data science applications demand solving large-scale optimization problems. The prevalent approaches are first-order methods, valued for their scalability. These methods are implemented to tackle highly irregular problems where…
Existing work on theorem proving for the assertion language of separation logic (SL) either focuses on abstract semantics which are not readily available in most applications of program verification, or on concrete models for which…
We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…
It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…
We apply the functional renormalization group theory to the dynamics of first-order phase transitions and show that a potential with all odd-order terms can describe spinodal decomposition phenomena. We derive a momentum-dependent dynamic…
We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…
The standard interpretation of first-order number theory (PA), according to the generally accepted view, associates well-defined set-theoretic entities with each and every well-formed formula of this system. But this implies that the class…
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…
In this article we obtain a complete description of the congruences of lines in $\p^4$ of order one provided that the fundamental surface $F$ is non-reduced (and possibly reducible) at one of its generic points, and their classification…
Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…
The first well founded perturbation theory for classical solid systems is presented. Theoretical approaches to thermodynamic and structural properties of the hard-sphere solid provide us with the reference system. The traditional…
Let M be a polynomially bounded, o-minimal structure with archimedean prime model, for example if M is a real closed field. Let C be a convex and unbounded subset of M. We determine the first order theory of the structure M expanded by the…
We introduce tree-width for first order formulae \phi, fotw(\phi). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formulae of bounded fotw, model checking is fixed…
Much research has been done on structures equivalent to topological or simplicial groups. In this paper, we consider instead simplicial monoids. In particular, we show that the usual model category structure on the category of simplicial…
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…