Quantum mechanics, ontology, and non-reflexive logics

Decio Krause

Home/Archive/arXiv

arXiv · 1802.03805

Quantum mechanics, ontology, and non-reflexive logics

Decio Krause

View original source ↗Read source document ↗Export metadata ↓

Abstract

This is a general philosophical paper where I overview some ideas concerning the non-reflexive foundations of quantum mechanics (NRFQM). By NRFQM I mean formalism and an interpretation of QM that considers an involved ontology of non-individuals as explained in the text. Thus, I do not endorse a purely instrumentalist view of QM, but believe that it speaks of something, and then I try to show that one of the plausible views of this `something' is as entities devoid of identity conditions. Warning note: This is a revised version of a paper with the same name that was written by invitation to be published in a book titled \textit{The Mammoth Book on Quantum Mechanics Interpretations}, edited by Open Academic Press, Berlin, and having as editor a certain Ulf Edvinsson, who has invited me. The book was announced in the page of OAP and should appear by 2016. This never happened. Later I discovered that OAP is in a list of predatory editorial houses and that "Ulf Edvinsson" is (apparently) a fake name. Furthermore, I couldn't contact anyone responding by OAP to retire my name from the announcement of the book and for impeding them to publish the paper. I strongly apologize for such a fault, which is completely mine. Since the subject presented here has been among my preoccupations ever since I met Franscicso Antonio Doria for the first time (in 1987), it is a pleasure to dedicate the stuff to him. And of course I thank the editors for accepting this version of the paper for this book.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Decio Krause. 2018-02-11. Quantum mechanics, ontology, and non-reflexive logics. https://arxiv.org/abs/1802.03805

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗