Related papers: Fibered Universal Algebra for First-Order Logics

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We…

This paper concerns an expansion of first-order Belnap-Dunn logic whose connectives and quantifiers all have a counterpart in classical logic. The language and logical consequence relation of this paradefinite logic are defined, a sequent…

Given a finitely generated and projective Lie-Rinehart algebra, we show that there is a continuous homomorphism of complete commutative Hopf algebroids between the completion of the finite dual of its universal enveloping Hopf algebroid and…

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…

Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…

The aim of this paper is to study categorified algebraic structures and their pseudo- and lax homomorphisms using the framework of Lawvere $2$-theories, and more generally, (enhanced) $2$-dimensional sketches. The key notion we focus on is…

Let $G$ be a residually finite, good group of finite virtual cohomological dimension. We prove that the natural monomorphism $G\hookrightarrow\hat{G}$ induces a bijective correspondence between conjugacy classes of finite $p$-subgroups of…

We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…

For a fixed finite group $Q$ and semi-simple finite dimensional algebra $S$, we examine an equivalence between strongly $Q$-graded algebras (extensions) with identity component $S$ and $S^1$-gerbes on action groupoids of $Q$ on the set of…

We present automated theorem provers for the first-order logic of here and there (HT). They are based on a native sequent calculus for the logic of HT and an axiomatic embedding of the logic of HT into intuitionistic logic. The analytic…

We impose a rather unknown algebraic structure called a `hyperstructure' to the underlying space of an affine algebraic group scheme. This algebraic structure generalizes the classical group structure and is canonically defined by the…

We classify all finite-dimensional connected Hopf algebras with large abelian primitive spaces. We show that they are Hopf algebra extensions of restricted enveloping algebras of certain restricted Lie algebras. For any abelian matched pair…

By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…

The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…

In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…

Certain quantization problems are equivalent to the construction of morphisms from "quantum" to "classical" props. Once such a morphism is constructed, Hensel's lemma shows that it is in fact an isomorphism. This gives a new, simple proof…

A general framework is proposed for integration of rules and external first order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive…

We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…