Related papers: Interpreting the weak monadic second order theory …
In a recent paper, Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic. THEOREM: The first-order theories of Peano arithmetic and ZF with the axiom of infinity negated are…
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a…
The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…
Let $q$ be an algebraic Lie algebra and $q<m>$ a (generalised) Takiff algebra. Any finite order automorphism $\theta$ of $q$ induces an automorphisms of $q<m>$ of the same order, denoted $\Theta$. We study invariant-theoretic properties of…
In this paper we analyze and discuss the historical and philosophical development of the notion of logical possibility focusing on its specific meaning in classical and quantum mechanics. Taking into account the logical structure of quantum…
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…
We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…
In this paper, we argue that formal systems of first order Arithmetic that admit Goedelian undecidable propositions validly are abnormally non-constructive. We argue that, in such systems, the strong representation of primitive recursive…
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter…
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order logic, a natural extension of monadic second-order logic), and to be recognizable in an algebraic framework induced by…
We show that constructible models of arbitrary complete continuous first-order theories are unique up to isomorphism.
Hahn groups endowed with the canonical valuation play a fundamental role in the classification of valued abelian groups. In this paper we study the group of valuation (respectively order) preserving automorphisms of a Hahn group $G$. Under…
In this paper we study admissible extensions of several theories T of reverse mathematics. The idea is that in such an extension the structure M = (N,S,\in) of the natural numbers N and collection of sets of natural numbers S has to obey…
This is the first of a series of papers which define and study structures called rootoids, which are groupoids equipped with a representation in the category of Boolean rings and with an associated 1-cocycle. The axioms for rootoids are…
This is the first of a series of articles providing a foundation for the theory of Drinfeld modular forms of arbitrary rank r. In the present part, we develop the analytic theory. Most of the work goes into defining and studying the…
This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…
We prove a new automorphy lifting theorem for l-adic representations where we impose a new condition at l, which we call `potential diagonalizability'. This result allows for `change of weight' and seems to be substantially more flexible…
We extend the Kechris--Pestov--Todor\v{c}evi\'c correspondence to weak Fra\"{\i}ss\'{e} categories and automorphism groups of generic objects. The new ingredient is the weak Ramsey property. We demonstrate the theory on several examples…
A subsemigroup $S$ of an inverse semigroup $Q$ is a left I-order in $Q$, if every element in $Q$ can be written as $a^{-1}b$ where $a, b \in S$ and $a^{-1}$ is the inverse of $a$ in the sense of inverse semigroup theory. We study a…
A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…