Related papers: Contrapositionally Complemented Pseudo-Boolean Alg…
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible…
We generalize the results on existence and uniqueness of integrals from compact groups and Hopf algebras in a pure (co)algebraic setting, and find a series of new results on (quasi)-co-Frobenius and semiperfect coalgebras. For a coalgebra…
Proof-theoretic semantics (P-tS) is the paradigm of semantics in which meaning in logic is based on proof (as opposed to truth). A particular instance of P-tS for intuitionistic propositional logic (IPL) is its base-extension semantics…
We offer the proofs that complete our article introducing the propositional calculus called semi-intuitionistic logic with strong negation.
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…
We study coupled logical bisimulation (CLB) to reason about contextual equivalence in the lambda-calculus. CLB originates in a work by Dal Lago, Sangiorgi and Alberti, as a tool to reason about a lambda-calculus with probabilistic…
The main purpose of this paper is to study the finite-dimensional solvable Lie algebras described in its title, which we call {\em minimal non-${\mathcal N}$}. To facilitate this we investigate solvable Lie algebras of nilpotent length $k$,…
This chapter presents a state-of-the-art survey of relationships, traditionally referred to as `bridges', between interpolation properties for propositional logics -- including superintuitionistic, modal, and substructural logics -- and…
We study post-Lie algebra structures on pairs of Lie algebras $(\mathfrak{g},\mathfrak{n})$, motivated by nil-affine actions of Lie groups. We prove existence results for such structures depending on the interplay of the algebraic…
Compositional reasoning in Vision-Language Models (VLMs) remains challenging as these models often struggle to relate objects, attributes, and spatial relationships. Recent methods aim to address these limitations by relying on the…
We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…
A Nijenhuis mock-Lie algebra is a mock-Lie algebra equipped with a Nijenhuis operator. The purpose of this paper is to extend the well-known results about Nijenhuis mock-Lie algebras to the realm of mock-Lie bialgebras. It aims to…
We consider one of the most natural extended affine Lie lagebras, the algebra $sl_2({\mathbb C}_q)$ and begin a theory of its representations. In particular, we study a class of imaginary Verma modules, obtain a criterion of irreducibility…
These notes cover the contents of three survey lectures held at the ICTP Trieste Summer school on High dimensional manifold theory 2001. They introduce techniques coming from the theory of operator algebras. We will focus on the basic…
In this paper we present a formalization of Intuitionistic Propositional Logic in the Lean proof assistant. Our approach focuses on verifying two completeness proofs for the studied logical system, as well as exploring the relation between…
Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…
A decade ago, Isham and Butterfield proposed a topos-theoretic approach to quantum mechanics, which meanwhile has been extended by Doering and Isham so as to provide a new mathematical foundation for all of physics. Last year, three of the…
We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…
The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…
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.…