相关论文: On Logics of Perfect Paradefinite Algebras

Ordinary algebra of formal power series in one variable is convenient to study by means of the algebra of Riordan matrices and the Riordan group. In this paper we consider algebra of formal power series without constant term, isomorphic to…

Craig interpolation is a fundamental property of classical and non-classic logics with a plethora of applications from philosophical logic to computer-aided verification. The question of which interpolants can be obtained from an…

In this paper we reexamine the definition of parafermions and parabosons by means of Green's triple relations, and extend these relations by including a parity operator $P$ which is also determined by means of triple relations. As a…

MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…

Inspired by a recent pointwise differential inequality for positive bounded solutions of the fourth-order H\'enon equation $\Delta^2 u = |x|^a u^p$ in ${\mathbb R}^n$ with $a \geqslant 0$, $p > 1$, $n \geqslant 5$ due to Fazly, Wei, and Xu…

Let $\mathscr{M}$ be a $II_1$ factor acting on the Hilbert space $\mathscr{H}$, and $\mathscr{M}_{\textrm{aff}}$ be the Murray-von Neumann algebra of closed densely-defined operators affiliated with $\mathscr{M}$. Let $\tau$ denote the…

Following Bezhanishvili & Vosmaer, we confirm a conjecture of Yde Venema by piecing together results from various authors. Specifically, we show that if $\mathbb{A}$ is a residually finite, finitely generated modal algebra such that…

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…

We introduce a novel strategy for constructing symmetric positive definite (SPD) preconditioners for linear systems with symmetric indefinite matrices. The strategy, called absolute value preconditioning, is motivated by the observation…

Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…

A charge (finitely additive measure) defined on a Boolean algebra of sets taking values in a group $G$ is called a strictly nonzero (SNZ) charge if it takes the identity value in $G$ only for the zero element of the Boolean algebra. A study…

A universality of deformed Heisenberg algebra involving the reflection operator is revealed. It is shown that in addition to the well-known infinite-dimensional representations related to parabosons, the algebra has also finite-dimensional…

This paper studies the abelian subalgebras and ideals of maximal dimension of Poisson algebras $\mathcal{P}$ of dimension $n$. We introduce the invariants $\alpha$ and $\beta$ for Poisson algebras, which correspond to the dimension of an…

An arbitrary $m\times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M =U\circ V$, where $U$ (resp. $V$) is an $m\times k$ (resp. $k\times n$) Boolean matrix and $\circ$ denotes the Boolean matrix multiplication operator. We…

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Plane partitions in the totally symmetric self-complementary symmetry class (TSSCPP) are known to be equinumerous with n x n alternating sign matrices, but no explicit bijection is known. In this paper, we give a bijection from these plane…

A paradefinite logic is a logic that can serve as the underlying logic for theories that are inconsistent or incomplete. A well-known paradefinite logic is Belnap-Dunn logic. Various expansions of Belnap-Dunn logic have been studied in the…

This paper provides an algorithmic generalization of Dickson's method of classifying permutation polynomials (PPs) of a given degree $d$ over finite fields. Dickson's idea is to formulate from Hermite's criterion several polynomial…

We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider general properties of regular ideals and their Boolean…

In an earlier paper, we introduced ``bordered knot algebras'', which are graded algebras indexed by a pair of integers (m,k). In a subsequent paper, we introduced a two-parameter family of differential graded algebra, the ``pong algebras'',…