Related papers: The Logic of CMV-Algebras

We use the algebraic framework for languages of infinite trees introduced in [4] to derive effective characterisations of various temporal logics, in particular the logic EF (a fragment of CTL) and its counting variant cEF.

In this note we prove that single-conclusion admissible rules of any proper axiomatic extension of the infnite valued Lukasiewicz logic are finitely based.

In a recent work Foulis and Pulmannov\' a \cite{Foulis2012} studied the logical connectives in lattice effect algebras. In this paper we extend their study and investigate further the logical calculus for which the lattice effect algebras…

We study a real valued propositional logic with unbounded positive and negative truth values that we call R-valued logic. Such logic slightly extends continuous propositional logic which, in turn, builds on Lukasiewicz many-valued logic.…

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,…

We build, using the notion of zinbiel algebra, some commutative subalgebras $C_{u,v}$ inside an algebra of formal iterated integrals. There is a quotient map from this algebra of formal iterated integrals to the algebra of motivic multiple…

This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue…

Previous work has shown that certain leading orders of arbitrary Vassiliev invariants are generically in the algebra of the coefficients of the Alexander-Conway polynomial \cite{KSA}. Here we illustrate this for a large class of examples,…

In the framework of propositional {\L}ukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly…

We apply results from the geometry of nilpotent orbits and nilpotent Slodowy slices, together with modularity and asymptotic analysis of characters, to prove many new isomorphisms between affine W-algebras and affine Kac-Moody vertex…

Generalizing the notion of a multiplicative unitary (in the sense of Baaj-Skandalis), which plays a fundamental role in the theory of locally compact quantum groups, we develop in this paper the notion of a multiplicative partial isometry.…

The aim of this paper is to introduce the idea of Logic with Verbs and to show its mathematical structure.

In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a relation between this system and linear logic.

We investigate the computational complexity of admissibility of inference rules in infinite-valued {\L}ukasiewicz propositional logic (\L). It was shown in [13] that admissibility in {\L} is checkable in PSPACE. We establish that this…

We study counting propositional logic as an extension of propositional logic with counting quantifiers. We prove that the complexity of the underlying decision problem perfectly matches the appropriate level of Wagner's counting hierarchy,…

We consider two Z/2Z-actions on the Podles generic quantum spheres. They yield, as noncommutative quotient spaces, the Klimek-Lesniewski q-disc and the quantum real projective space, respectively. The C*-algebras of all these quantum spaces…

We obtain a description of the C*-algebras which can occur as a simple quotient of the C*-algebra of a locally injective surjection on a compact metric space of finite covering dimension.

B\"{u}chi and Owen studied algebraic structures called hoops. Hoops provide a natural algebraic semantics for a class of substructural logics that we think of as intuitionistic analogues of the widely studied {\L}ukasiewicz logics. Ben…

This paper surveys the recent advances in the interactions between symbolic dynamics and C*-algebras. We explain how conjugacies and orbit equivalences of both two-sided (invertible) and one-sided (noninvertible) symbolic systems may be…

Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of…