Related papers: Continuous Algebra: Algebraic Semantics for Contin…
We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…
The continuous functional calculus is perhaps the most fundamental construction in the theory of operator algebras, especially $C^{*}$-algebras. Here we document our formalization of the continuous functional calculus in Lean, which…
Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause…
The article is devoted to some ``strange'' phenomena of representation theory and their interrelations. Cross-projective representations of pairs of anticommutative algebras, alloys, their universal envelopping Lie algebras and their…
A continuous-time Markov chain (CTMC) execution is a continuous class of probability distributions over states. This paper proposes a probabilistic linear-time temporal logic, namely continuous-time linear logic (CLL), to reason about the…
The goal of this paper is to establish that it remains undecidable whether a sequent is provable in two systems in which a weakening rule for an exponential modality is completely omitted from classical propositional linear logic…
In this paper, we initiate the generalisation of the operadic calculus which governs the properties of homotopy algebras to a properadic calculus which governs the properties of homotopy gebras over a properad. In this first article of a…
In these notes we review some basic facts about the LLV Lie algebra. It is a rational Lie algebra, introduced by Looijenga-Lunts and Verbitsky, acting on the rational cohomology of a compact K\"{a}hler manifold. We study its structure and…
Propositional Dynamic Logic, PDL, is a modal logic designed to formalize the reasoning about programs. By extending accessibility between states to states and state sets, concurrent propositional dynamic logic CPDL, is introduced to include…
We describe a categorical model of MALL (Multiplicative Additive Linear Logic) inspired by the Heisenberg-Schr\"odinger duality of finite-dimensional quantum theory. Proofs of formulas with positive logical polarity correspond to CPTP…
We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on justification terms and equality predicate on terms. In…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
Over the past three decades, the logic programming paradigm has been successfully expanded to support probabilistic modeling, inference and learning. The resulting paradigm of probabilistic logic programming (PLP) and its programming…
We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to 'recover' the properties of classical…
The present paper investigates proof-theoretical and algebraic properties for the probability logic FP(L,L), meant for reasoning on the uncertainty of Lukasiewicz events. Methodologically speaking, we will consider a translation function…
Motivated by the classical correspondence between short exact sequences and splitting properties in module theory, this paper examines the projective and injective analogues within the category of Lie algebras. We first show that no Lie…
MV-algebras were introduced by Chang to prove the completeness of the infinite-valued Lukasiewicz propositional calculus. In this paper we give a categorical equivalence between the varieties of (n+1)-valued MV-algebras and the classes of…
Plausible reasoning concerns situations whose inherent lack of precision is not quantified; that is, there are no degrees or levels of precision, and hence no use of numbers like probabilities. A hopefully comprehensive set of principles…
Constraint Logic Programming (CLP) is a logic programming formalism used to solve problems requiring the consideration of constraints, like resource allocation and automated planning and scheduling. It has previously been extended in…
In this paper we give a new proof for the completeness of infinite valued propositional \L ukasiewicz logic introduced by \L ukasiewicz and Tarski in 1930. Our approach employs a Hilbert-style proof that relies on the concept of maximal…