Related papers: Superabelian logics
We study degree bounds on rational but not necessarily polynomial generators for the field $\mathbf{k}(V)^G$ of rational invariants of a linear action of a finite abelian group. We show that lattice-theoretic methods used recently by the…
In the framework of propositional {\L}ukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly…
We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…
Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory…
We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…
We construct for every proper algebraic space over a ground field an Albanese map to a para-abelian variety, which is unique up to unique isomorphism. This holds in the absence of rational points or ample sheaves, and also for reducible or…
A classification of (super) $W$ algebras arising from non Abelian Toda and super Toda theories is presented. This classification is based on the $Sl(2)$ or $OSp(1|2)$ sub(super)algebras of the simple Lie (super)algebra underlying the model.…
The aim of the paper is to establish a certain logic corresponding to lattice effect algebras. First, we answer a natural question whether a lattice effect algebra can be represented by means of a groupoid-like structure. We establish a…
We use recurrence relations to derive explicit formulas for counting the number of subgroups of given order (or index) in rank 3 finite abelian p-groups and use these to derive similar formulas in few cases for rank 4. As a consequence, we…
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…
An automorphism $\alpha$ of a group $G$ is said to be central if $\alpha$ commutes with every inner automorphism of $G$. We construct a family of non-special finite $p$-groups having abelian automorphism groups. These groups provide counter…
We initiate the study of $\lambda$-fold near-factorizations of groups with $\lambda > 1$. While $\lambda$-fold near-factorizations of groups with $\lambda = 1$ have been studied in numerous papers, this is the first detailed treatment for…
We review and analyse techniques from the literature for extending a normed algebra, A to a normed algebra, B, so that B has interesting or desirable properties which A may lack. For example, B might include roots of monic polynomials over…
The present work is devoted to characterize the family of symmetric undirected Cayley graphs over finite Abelian groups for degrees 4 and 6.
We realize the infinitesimal Abel-Jacobi map as a morphism of formal deformation theories, realized as a morphism in the homotopy category of differential graded Lie algebras. The whole construction is carried out in a general setting, of…
Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions. We identify a natural…
We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…
We present a first-order probabilistic epistemic logic, which allows combining operators of knowledge and probability within a group of possibly infinitely many agents. The proposed framework is the first order extension of the logic of…
The syntactic calculus of Lambek is a deductive system for the multiplicative fragment of intuitionistic non-commutative linear logic. As a fine-grained calculus of resources, it has many applications, mostly in formal computational…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…