Related papers: Many-valued coalgebraic logic over semi-primal var…
Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…
Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic…
This paper lays the groundwork for the theory of categorical diagonalization. Given a diagonalizable operator, tools in linear algebra (such as Lagrange interpolation) allow one to construct a collection of idempotents which project to each…
The aim of this paper is to propose a many-valued modal framework to formalize reasoning with both graded preferences and propositions, in the style of van Benthem et al.'s classical modal logics for preferences. To do so, we start from Bou…
In previous work, categories of algebras of endofunctors were shown to be enriched in categories of coalgebras of the same endofunctor, and the extra structure of that enrichment was used to define a generalization of inductive data types.…
A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…
In this article, we combine Sweedler's classic theory of measuring coalgebras -- by which $k$-algebras are enriched in $k$-coalgebras for $k$ a field -- with the theory of W-types -- by which the categorical semantics of inductive data…
The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…
We introduce a complete many-valued semantics for basic normal lattice-based modal logic. This relational semantics is grounded on many-valued formal contexts from Formal Concept Analysis. We discuss an interpretation and possible…
In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
It is shown that quantum logic is a logic in the very same way in which classical logic is a logic. Soundness and completeness of both quantum and classical logics have been proved for novel lattice models that are not orthomodular and…
The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…
Coalgebra, as the abstract study of state-based systems, comes naturally equipped with a notion of behavioural equivalence that identifies states exhibiting the same behaviour. In many cases, however, this equivalence is finer than the…
The article demonstrates that logic is not necessarily singleton and does not always have the standard interpretation of negation. Appropriate generalizations of logic are suggested. Positive logic and multivalued negation operations are…
We continue our investigation into hybrid polyadic multi-sorted logic with a focus on expresivity related to the operational and axiomatic semantics of rogramming languages, and relations with first-order logic. We identify a fragment of…
Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…
Functor coalgebras capture a wide range of transition systems that must however evolve in discrete steps. We introduce graded coalgebras of graded monads and propose them to model continuous-time transition systems. We develop the theory of…
In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…