Related papers: Expanding FLew with a Boolean connective
FL$_\mathrm{ew}$-algebras form the algebraic semantics of the full Lambek calculus with exchange and weakening. We investigate two relations, called satisfiability and positive satisfiability, between FL$_\mathrm{ew}$-terms and…
In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that…
Funayama proved that a lattice embeds into a complete Boolean algebra in such a way that all existing joins and meets are preserved if and only if the lattice satisfies the join-infinite and meet-infinite distributive laws. There are…
In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…
We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) two-variable logic as well…
The present paper deals with complemented lattices where, however, a unary operation of complementation is not explicitly assumed. This means that an element can have several complements. The mapping $^+$ assigning to each element $a$ the…
We present modules for the extended affine Lie algebra $\widetilde{\frak{gl}_{3}(\bc_q)}$ by using the idea of free fields. A necessary and sufficient condition for the modules being unitary is given.
This paper presents a construction which transforms categorical models of additive-free propositional linear logic, closely based on de Paiva's dialectica categories and Oliva's functional interpretations of classical linear logic. The…
We consider the equivalence of Lawvere theories and finitary monads on Set from the perspective of Endf(Set)-enriched category theory, where Endf(Set) is the category of finitary endofunctors of Set. We identify finitary monads with…
We prove that the Weihrauch lattice can be transformed into a Brouwer algebra by the consecutive application of two closure operators in the appropriate order: first completion and then parallelization. The closure operator of completion is…
Following the classical approach of Birkhoff, we suggest an enriched version of enriched universal algebra. Given a suitable base of enrichment $\mathcal V$, we define a language $\mathbb L$ to be a collection of $(X,Y)$-ary function…
Given the congruence lattice L of a finite algebra A with a Mal'cev term, we look for those sequences of operations on L that are sequences of higher commutator operations of expansions of A. The properties of higher commutators proved so…
We extend the theorem of Liouville on integration in finite terms to include dilogarithmic integrals. The results provide a necessary and sufficient condition for an element of the base field to have an antiderivative in a field extension…
We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.
We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part…
We consider the deconstruction/reconstruction of extensions in varieties of algebras which are modules expanded by multilinear operators. The parametrization of extensions determined by abelian ideals with unary actions agrees with the…
First-Order Logic (FOL) is widely regarded as one of the most important foundations for knowledge representation. Nevertheless, in this paper, we argue that FOL has several critical issues for this purpose. Instead, we propose an…
Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…
In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…
We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…