相关论文: Properties of the connective implication in effect…
In this article, we only consider finite effect algebras. We define the concepts of classical and quantum effect algebras and show that an effect algebra $E$ is classical if and only if there exists an observable that measures every effect…
The aim of this paper is to show that there can be either only one or uncountably many contexts in any spectral effect algebra, answering a question posed in [S. Gudder, Convex and Sequential Effect Algebras, (2018), arXiv:1802.01265]. We…
We study a physically motivated representation of an algebra of operators in gravitational and non gravitational theories called the covariant representation of an algebra. This is a representation where the symmetries of the operator…
Since orthomodular posets serve as an algebraic axiomatization of the logic of quantum mechanics, it is a natural question how the connective of implication can be defined in this logic. It should be introduced in such a way that it is…
Our basic structure is a finite-dimensional complex Hilbert space $H$. We point out that the set of effects on $H$ form a convex effect algebra. Although the set of operators on $H$ also form a convex effect algebra, they have a more…
Quantum computational logics represent a logical abstraction from the circuit-theory in quantum computation. In these logics formulas are supposed to denote pieces of quantum information (qubits, quregisters or mixtures of quregisters),…
This article is an exploratory account of the the non-monotonic behaviour of conceptual associations in the light of context. Computational approximations of conceptual space are furnished by semantic space models which are emerging from…
Effect algebras are one of the generalizations of Boolean algebras proposed in the quest for a quantum logic. Frobenius algebras are a tool of categorical quantum mechanics, used to present various families of observables in abstract, often…
This paper is devoted to the investigation of term-definable connexive implications in substructural logics with exchange and, on the semantical perspective, in sub-varieties of commutative residuated lattices (FLe-algebras). In particular,…
This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…
We show how an effect algebra $\mathcal{X}$ can be regarded as a category, where the morphisms $x \rightarrow y$ are the elements $f$ such that $x \leq f \leq y$. This gives an embedding $\mathbf{EA} \rightarrow \mathbf{Cat}$. The interval…
The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…
Algebraic effects are computational effects that can be represented by an equational theory whose operations produce the effects at hand. The free model of this theory induces the expected computational monad for the corresponding effect.…
Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…
Orthomodular posets form an algebraic formalization of the logic of quantum mechanics. The question is how to introduce the connective implication in such a logic. We show that this is possible when the orthomodular poset in question is of…
Effect algebras were introduced as an abstract algebraic model for Hilbert space effects representing quantum mechanical measurements. We study additional structures on an effect algebra $E$ that enable us to define spectrality and spectral…
The aim of the paper is to establish a certain logic corresponding to lattice effect algebras. First, we answer a natural question whether a lattice effect algebra can be represented by means of a groupoid-like structure. We establish a…
This dissertation is concerned with the study of program equivalence and algebraic effects as they arise in the theory of programming languages. Algebraic effects represent impure behaviour in a functional programming language, such as…
Free categorical constructions characterise quantum computing as the combination of two copies of a reversible classical model, glued by the complementarity equations of classical structures. This recipe effectively constructs a…
Effectivity functions are the basic formalism for investigating the semantics game logic. We discuss algebraic properties of stochastic effectivity functions, in particular the relationship to stochastic relations, morphisms and congruences…