Related papers: Eigenlogic: a Quantum View for Multiple-Valued and…
Substantial progress has recently been reported in the determination of the Hilbert-Schmidt (HS) separability probabilities for two-qubit and qubit-qutrit (real, complex and quaternionic) systems. An important theoretical concept employed…
We present the axiomatisation of the fuzzy bi-G\"{o}del modal logic (formulated in the language containing $\triangle$ and treating the coimplication as a defined connective) and establish its PSpace-completeness. We also consider its…
Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for…
Tensor eigenvalues and eigenvectors have been introduced in the recent mathematical literature as a generalization of the usual matrix eigenvalues and eigenvectors. We apply this formalism to a tensor that describes a multipartite symmetric…
The observable algebra O of SO_q(3)-symmetric quantum mechanics is generated by the coordinates of momentum and position spaces (which are both isomorphic to the SO_q(3)-covariant real quantum space R_q^3). Their interrelations are…
Dynamic logic is a powerful framework for reasoning about imperative programs. An extension with a concurrent operator [18] was introduced to formalise programs running in parallel. In other direction, other authors proposed a systematic…
The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…
The random matrix ensembles are applied to the quantum statistical two-dimensional systems of electrons. The quantum systems are studied using the finite dimensional real, complex and quaternion Hilbert spaces of the eigenfunctions. The…
Given a quantum state in the finite-dimensional Hilbert space $ \C^n $, the range of possible values of a quantum observable is usually identified with the discrete spectrum of eigenvalues of a corresponding Hermitian matrix. Here any such…
Event generating algorithm corresponding to a linear master equation of Lindblad's type is described and illustrated on two examples: that of a particle detector and of a fuzzy clock. Relation to other approaches to foundations of quantum…
Fuzzy spaces are obtained by quantizing adjoint orbits of compact semi-simple Lie groups. Fuzzy spheres emerge from quantizing S^2 and are associated with the group SU(2) in this manner. They are useful for regularizing quantum field…
Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking…
We study the eigenvalue equation for the 'Cartesian coordinates' observables $x_i$ on the fully $O(2)$-covariant fuzzy circle $\{S^1_\Lambda\}_{\Lambda\in\mathbb{N}}$ ($i=1,2$) and on the fully $O(3)$-covariant fuzzy 2-sphere…
Fuzzy logic programming is a growing declarative paradigm aiming to integrate fuzzy logic into logic programming. One of the most difficult tasks when specifying a fuzzy logic program is determining the right weights for each rule, as well…
Our research builds upon Halmos's foundational work on functional monadic Boolean algebras and our previous work on tense operators to develop three essential constructions, including the important concepts of fuzzy sets and powerset…
This work explores the connection between logical independence and the algebraic structure of quantum mechanics. Building on results by Brukner et al., it introduces the notion of \textit{onto-epistemic ignorance}: situations in which the…
We study bisimulations for useful description logics. The simplest among the considered logics is $\mathcal{ALC}_{reg}$ (a variant of PDL). The others extend that logic with inverse roles, nominals, quantified number restrictions, the…
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
An introduction is given to an algebraic formulation and generalisation of the consistent histories approach to quantum theory. The main technical tool in this theory is an orthoalgebra of history propositions that serves as a generalised…
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…