Related papers: Superabelian logics
One of the most studied algebraic structures with one operation is the Abelian group, which is defined as a structure whose operation satisfies the associative and commutative properties, has identical element and every element has an…
We prove that the theory of abelian groups and R-modules even in infinitary logic is stable and understood to some extent.
This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…
Braces were introduced by Rump to study involutive non-degenerate set-theoretic solutions of the Yang-Baxter equation. A constructive method for producing all such finite solutions from a description of all finite left braces has been…
The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work…
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…
Following a characterization [10] of locally tabular logics with finitary (or unitary) unification by their Kripke models we determine the unification types of some intermediate logics (extensions of {\sf INT}). There are exactly four…
We present finitary formulations of two well known results concerning infinite series, namely Abel's theorem, which establishes that if a series converges to some limit then its Abel sum converges to the same limit, and Tauber's theorem,…
We address a question of Cavenagh and Wanless asking: which finite abelian groups arise as the canonical group of a spherical latin bitrade? We prove the existence of an infinite family of finite abelian groups that do not arise as…
We classify finite-dimensional complex Hopf algebras $A$ which are pointed, that is, all of whose irreducible comodules are one-dimensional, and whose group of group-like elements $G(A)$ is abelian such that all prime divisors of the order…
Using methods of associative algebras, Lie theory, group cohomology, and modular representation theory, we construct profinite $p$-adic analytic groups such that the centralizer of each of their non-trivial elements is abelian. The paper…
The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…
Ergodic theory, Higher order Fourier analysis and the hyper graph regularity method are three possible approaches to Szemer\'edi type theorems in abelian groups. In this paper we develop an algebraic theory that creates a connection between…
Inquisitive logic is a research program that extends the scope of logic to cover not only statements, but also questions. In the context of this program, a logic that plays a prominent role is inquisitive first-order logic, InqBQ, which…
In this paper the new techniques and results concerning the structure theory of modules over non-commutative Iwasawa algebras are applied to arithmetic: we study Iwasawa modules over p-adic Lie extensions K of number fields k "up to…
In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
We consider Abelian extensions of global symmetries of the form $A \to G \to K$, with $A$ finite (and similar higher-group structures). For a quantum field theory $\mathcal{T}$ with symmetry $G$, we compare gauging $G$ directly with gauging…
We extend the simply-typed guarded $\lambda$-calculus with discrete probabilities and endow it with a program logic for reasoning about relational properties of guarded probabilistic computations. This provides a framework for programming…
We suggest an approach for description of integrable cases of the Abel equations. It is based on increasing of the order of equations up to the second one and using equivalence transformations for the corresponding second-order ordinary…