Related papers: Linear Orders in Presburger Arithmetic

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…

We consider a declarative framework for machine learning where concepts and hypotheses are defined by formulas of a logic over some background structure. We show that within this framework, concepts defined by first-order formulas over a…

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Let $\mathcal{R}$ be an expansion of the ordered real additive group. When $\mathcal{R}$ is o-minimal, it is known that either $\mathcal{R}$ defines an ordered field isomorphic to $(\mathbb{R},<,+,\cdot)$ on some open subinterval…

In the 1970s M. Laczkovich posed the following problem: Let $\mathcal{B}_1(X)$ denote the set of Baire class $1$ functions defined on an uncountable Polish space $X$ equipped with the pointwise ordering. \[\text{Characterize the order types…

Let $W$ be a finite Coxeter group and $L$ be a weight function on $W$ in the sense of Lusztig. We have recently introduced a pre-order relation $\preceq_L$ on the set of irreducible characters of $W$ which extends Lusztig's definition of…

This article contains the theorems which shows that when $A(z)=h_1(z)e^{P_1(z)}$ and $B(z)=h_0(z)e^{P_0(z)}$ are of same order,then all the non-trivial solutions of equation $f"+A(z)f'+B(z)f=0$ are of infinite order. Moreover we extend…

In various places in the literature it is stated that every separable linear order embeds into the real line. This is, however, not the case, at least not with respect to the usual definition of separability. We correct this misconception.

Svenonius theorem reduces the problem of first-order definability to the problem of relationship between groups of permutations. In the present paper we use this approach to describe the lattice of definable relations for the structure of…

We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr\"om quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization…

We deal with first-order definability in the embeddability ordering $( \mathcal{D}; \leq)$ of finite directed graphs. A directed graph $G\in \mathcal{D}$ is said to be embeddable into $G' \in \mathcal{D}$ if there exists an injective graph…

We prove that the first-order logic of CZF is intuitionistic first-order logic. To do so, we introduce a new model of transfinite computation (Set Register Machines) and combine the resulting notion of realisability with Beth semantics. On…

We study prime tensor ideals in tensor abelian categories of quiver representations. Specifically, we classify the prime tensor ideals in the category of representations of zigzag quivers (with bounded path length) whose vertex set is the…

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

By fundamental results of Sch\"utzenberger, McNaughton and Papert from the 1970s, the classes of first-order definable and aperiodic languages coincide. Here, we extend this equivalence to a quantitative setting. For this, weighted automata…

A first order expansion of $(\mathbb{R},+,<)$ is dp-minimal if and only if it is o-minimal. We prove analogous results for algebraic closures of finite fields, $p$-adic fields, ordered abelian groups with only finitely many convex subgroups…

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained…

The matrix units of a digraph algebra, A, induce a relation, known as the diagonal order, on the projections in a masa in the algebra. Normalizing partial isometries in A act on these projections by conjugation; they are said to be order…

In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…