相关论文: On Logics of Perfect Paradefinite Algebras
The notion of a congruence pair for principal MS-algebras, simpler than the one given by Beazer for $K_2$-algebras \cite{6}, is introduced. It is proved that the congruences of the principal MS-algebras $L$ correspond to the MS-congruence…
This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…
This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…
We study elliptic and parabolic problems governed by the singular elliptic operators \begin{align*} \mathcal L=y^{\alpha_1}\mbox{Tr }\left(QD^2_xu\right)+2y^{\frac{\alpha_1+\alpha_2}{2}}q\cdot \nabla_xD_y+\gamma y^{\alpha_2}…
We develop a theory of parafree augmented algebras similar to the theory of parafree groups and explore some questions related to the Parafree Conjecture. We provide an example of finitely generated parafree augmented algebra of infinite…
Belnap-Dunn's relevance logic, BD, was designed seeking a suitable logical device for dealing with multiple information sources which sometimes may provide inconsistent and/or incomplete pieces of information. BD is a four-valued logic…
One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…
By using a coherent state quantization of paragrassmann variables, operators are constructed in finite Hilbert spaces. We thus obtain in a straightforward way a matrix representation of the paragrassmann algebra. This algebra of finite…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
The dynamical symmetries of $1+1$-dimensional Matrix Partial Differential Equations with a Calogero potential (with/without the presence of an extra oscillatorial De Alfaro-Fubini-Furlan, DFF, damping term) are investigated. The first-order…
In the present paper we review the progress of the project of classification and construction of invariant differential operators for non-compact semisimple Lie groups. Our starting points is the class of algebras, which we called earlier…
A general notion of a quasi-finite algebra is introduced as an algebra graded by the set of all integers equipped with topologies on the homogeneous subspaces satisfying certain properties. An analogue of the regular bimodule is introduced…
It is well known that there is a correspondence between sets and complete, atomic Boolean algebras (CABA's) taking a set to its power-set and, reciprocally, a complete, atomic Boolean algebra to its set of atomic elements. Of course, such a…
In the present paper we continue the project of systematic construction of invariant differential operators for non-compact semisimple Lie groups. Our starting points is the class of algebras, which we call 'conformal Lie algebras' (CLA),…
We introduce a paraconsistent expansion of the G\"{o}del logic with a De Morgan negation $\neg$ and modalities $\blacksquare$ and $\blacklozenge$. We equip it with Kripke semantics on frames with two (possibly fuzzy) relations: $R^+$ and…
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…
A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…
We introduce a framework for proving statements about linear operators by verification of ideal membership in a free algebra. More specifically, arbitrary first-order statements about identities of morphisms in preadditive semicategories…
In \cite{LC, LCMF}, it was introduced a logic (called \Six ) associated to a class of algebraic structures known as {\em involutive Stone algebras}. This class of algebras, denoted by \Sto , was considered by the first time in \cite{CS1} as…
We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic…