Quasi-matrix logic as a paraconsistent logic for dubitable information

We distinguish three types of statements — indubitably true statements (the value “n”), indubitably false statements (the value “i”) and statements of dubitable information (the value “c”)

Deformation Quantization: Quantum Mechanics Lives and Works in Phase-Space

Wigner's quasi-probability distribution function in phase-space is a special (Weyl) representation of the density matrix. It has been useful in describing quantum transport in quantum optics; nuclear physics; decoherence (eg, quantum computing); quantum chaos; "Welcher Weg" discussions; semiclassical limits. It is also of importance in signal processing. Nevertheless, a remarkable aspect of its internal logic, pioneered by Moyal, has only emerged in the last quarter-century: It furnishes a third, alternative, formulation of Quantum Mechanics, independent of the conventional Hilbert Space, or Path Integral formulations. In this logically complete and self-standing formulation, one need not choose sides--coordinate or momentum space. It works in full phase-space, accommodating the uncertainty principle. This is an introductory overview of the formulation with simple illustrations.Comment: LaTeX, 22 pages, 2 figure

Post Completeness in Congruential Modal Logics

Well-known results due to David Makinson show that there are exactly two Post complete normal modal logics, that in both of them, the modal operator is truth-functional, and that every consistent normal modal logic can be extended to at least one of them. Lloyd Humberstone has recently shown that a natural analog of this result in congruential modal logics fails, by showing that not every congruential modal logic can be extended to one in which the modal operator is truth-functional. As Humberstone notes, the issue of Post completeness in congruential modal logics is not well understood. The present article shows that in contrast to normal modal logics, the extent of the property of Post completeness among congruential modal logics depends on the background set of logics. Some basic results on the corresponding properties of Post completeness are established, in particular that although a congruential modal logic is Post complete among all modal logics if and only if its modality is truth-functional, there are continuum many modal logics Post complete among congruential modal logics

Extending Kolmogorov's axioms for a generalized probability theory on collections of contexts

Kolmogorov's axioms of probability theory are extended to conditional probabilities among distinct (and sometimes intertwining) contexts. Formally, this amounts to row stochastic matrices whose entries characterize the conditional probability to find some observable (postselection) in one context, given an observable (preselection) in another context. As the respective probabilities need not (but, depending on the physical/model realization, can) be of the Born rule type, this generalizes approaches to quantum probabilities by Auff\'eves and Grangier, which in turn are inspired by Gleason's theorem.Comment: 18 pages, 3 figures, greatly revise

When Can Matrix Query Languages Discern Matrices?

We investigate when two graphs, represented by their adjacency matrices, can be distinguished by means of sentences formed in MATLANG, a matrix query language which supports a number of elementary linear algebra operators. When undirected graphs are concerned, and hence the adjacency matrices are real and symmetric, precise characterisations are in place when two graphs (i.e., their adjacency matrices) can be distinguished. Turning to directed graphs, one has to deal with asymmetric adjacency matrices. This complicates matters. Indeed, it requires to understand the more general problem of when two arbitrary matrices can be distinguished in MATLANG. We provide characterisations of the distinguishing power of MATLANG on real and complex matrices, and on adjacency matrices of directed graphs in particular. The proof techniques are a combination of insights from the symmetric matrix case and results from linear algebra and linear control theory

Beyond Model-Checking CSL for QBDs: Resets, Batches and Rewards

We propose and discuss a number of extensions to quasi-birth-death models (QBDs) for which CSL model checking is still possible, thus extending our recent work on CSL model checking of QBDs. We then equip the QBDs with rewards, and discuss algorithms and open research issues for model checking CSRL for QBDs with rewards