Logical Indeterminacy of the von Neumann Cut: A Structural Obstruction in Formal Theories

This paper establishes the logical indeterminacy of the von Neumann cut within a purely formal setting. The cut is treated as an internal distinction in a first-order axiomatic theory, without recourse to physical, probabilistic, or interpretative assumptions. We introduce an axiomatic framework Fcut , formulated in classical first-order logic and encompassing abstract C* -algebra together with an irreducible update operation. We show that any such framework admitting the iteration and comparison of update outcomes necessarily interprets Robinson arithmetic. As a consequence, Fcut admits Gödel arithmetisation and is therefore essentially incomplete. The indeterminacy of the cut thus arises as a structural property of the formal language itself, and not from any diagonal construction taken as a primitive assumption. This establishes that no consistent extension of Fcut can fix the cut, placing this indeterminacy alongside classical incompleteness phenomena as an intrinsic limitation of sufficiently expressive formal systems.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-03-09
DOI
https://doi.org/10.5281/zenodo.18916747
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Logical Indeterminacy of the von Neumann Cut: A Structural Obstruction in Formal Theories

Emmanuel A. P. Brandt
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
article

Logical Indeterminacy of the von Neumann Cut: A Structural Obstruction in Formal Theories

Emmanuel A. P. Brandt
article en

Abstract

This paper establishes the logical indeterminacy of the von Neumann cut within a purely formal setting. The cut is treated as an internal distinction in a first-order axiomatic theory, without recourse to physical, probabilistic, or interpretative assumptions. We introduce an axiomatic framework Fcut , formulated in classical first-order logic and encompassing abstract C* -algebra together with an irreducible update operation. We show that any such framework admitting the iteration and comparison of update outcomes necessarily interprets Robinson arithmetic. As a consequence, Fcut admits Gödel arithmetisation and is therefore essentially incomplete. The indeterminacy of the cut thus arises as a structural property of the formal language itself, and not from any diagonal construction taken as a primitive assumption. This establishes that no consistent extension of Fcut can fix the cut, placing this indeterminacy alongside classical incompleteness phenomena as an intrinsic limitation of sufficiently expressive formal systems.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 34%
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Logical Indeterminacy of the von Neumann Cut: A Structural Obstruction in Formal Theories — Emmanuel A. P. Brandt · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS