Related papers: Characterizing level one in group-based concatenat…
We give an algebraic characterization of the syntax and semantics of a class of simply-typed languages, such as the language PCF: we characterize simply-typed binding syntax equipped with reduction rules via a universal property, namely as…
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate…
We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…
This article is an introduction to formal languages from the point of view of combinatorial group theory. Group theoretic applications are included and language classes are defined algebraically.
We report some further developments regarding the language theory of higher-dimensional automata (HDAs). Regular languages of HDAs are sets of finite interval partially ordered multisets (pomsets) with interfaces. We show a pumping lemma…
We classify gradings by arbitrary abelian groups on the classical simple Lie superalgebras $P(n)$, $n \geq 2$, and on the simple associative superalgebras $M(m,n)$, $m, n \geq 1$, over an algebraically closed field: fine gradings up to…
We classify, up to isomorphism, the group gradings on the non-exceptional classical simple Lie superalgebras, except for type A(1,1), over an algebraically closed field of characteristic zero. To this end, we study graded-simple and…
We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A >>Cohen algebra<< is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of…
In this paper we describe all group gradings by a finite abelian group G of any Lie algebra L of the type "A" over algebraically closed field F of characteristic zero.
We study a model of one-way quantum automaton where only measurement operations are allowed ($\mon$). We give an algebraic characterization of $\lmo(\Sigma)$, showing that the syntactic monoids of the languages in $\lmo(\Sigma)$ are exactly…
A regular language $L$ is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-free-path finite automaton; this is…
We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…
Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic is investigated which fills this gap with the introduction…
We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…
This paper provides a new categorical definition of a normalization operator motivated by topos theory and its applications to algebraic language theory. We first define a normalization operator $\Xi \to \Xi$ in any category that admits a…
We formulate and prove a new variant of the Segal Conjecture describing the group of homotopy classes of stable maps from the p-completed classifying space of a finite group G to the classifying space of a compact Lie group K as the p-adic…
Let $G$ be a finite abelian group and let $K$ be an algebraically closed field of characteristic 0. We consider associative unital algebras $A$ over $K$ graded by $G$, that is $A=\oplus_{g\in G} A_g$, where the vector subspaces $A_g$…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
This paper presents an abstract, mathematical formulation of classical propositional logic. It proceeds layer by layer: (1) abstract, syntax-free propositions; (2) abstract, syntax-free contraction-weakening proofs; (3) distribution; (4)…
In the article we investigate three classes of extended Boolean Connexive Logics. Two of them are extensions of Modal and non-Modal Boolean Connexive Logics with a property of closure under an arbitrary number of negations. The remaining…