Search arXiv⌕ Search
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

Explore connections, maps & timelines

BibTeXRIS

Decio Krause. 2018-07-19. 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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗