Related papers: Group Order Logic

Let $\Omega$ be a finite set of finitary operation symbols. An $\Omega$-expanded group is a group (written additively and called the additive group of the $\Omega$-expanded group) with an $\Omega$-algebra structure. We use the black-box…

The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…

We produce, on general homogeneous groups, an analogue of the usual H\"ormander pseudodifferential calculus on Euclidean space, at least as far as products and adjoints are concerned. In contrast to earlier works, we do not limit ourselves…

Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…

We study Linear Temporal Logic Modulo Theories over Finite Traces (LTLfMT), a recently introduced extension of LTL over finite traces (LTLf) where propositions are replaced by first-order formulas and where first-order variables referring…

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…

For every $q\in \mathbb N$ let $\textrm{FO}_q$ denote the class of sentences of first-order logic FO of quantifier rank at most $q$. If a graph property can be defined in $\textrm{FO}_q$, then it can be decided in time $O(n^q)$. Thus,…

These are expanded lecture notes from lectures given at the Workshop on higher structures at MATRIX Melbourne. These notes give an introduction to Feynman categories and their applications. Feynman categories give a universal categorical…

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

A linear algebraic group $G$ is represented by the linear space of its algebraic functions $F(G)$ endowed with multiplication and comultiplication which turn it into a Hopf algebra. Supplying $G$ with a Poisson structure, we get a quantized…

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…

We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the…

For each $n=1,2,\dots$, let $\mathsf{GL}(n,\mathbb{Z})\ltimes \mathbb{Z}^n$ be the affine group over the integers. For every point $x=(x_1,\dots,x_n) \in \mathbb{R}^n$ let $\mathrm{orb}(x)=\{\gamma(x)\in \mathbb{R}^n\mid\gamma\in…

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…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

An abelian lattice-ordered group, or abelian $\ell$-group, is an abelian group equipped with a compatible lattice ordering. In this paper, we introduce two multi-sorted extensions of abelian lattice-ordered groups inspired by the zero-set…