Related papers: On Cantor's Theorem
Counterfactual definiteness must be used as at least one of the postulates or axioms that are necessary to derive Bell-type inequalities. It is considered by many to be a postulate that is not only commensurate with classical physics (as…
The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…
We describe the fundamental difference between the nature of problems in traditional physics and that of many problems arising today in systems biology and other complex settings. The difference hinges on the much larger number of a priori…
We give a combinatorial form of the Kadison-Singer problem, a famous problem in C*-algebra. This combinatorial problem, which has several minor variations, is a discrepancy question about vectors in C^n. Some partial results can be easily…
General relativity required the abandonment of Euclidean geometry. Here we show that quantum theory requires the abandonment of classical logic. We show that the Hilbert space representation of quantum theory is logically inevitable. There…
By careful analysis of the comparison map from a simplicial set to its image under Kan's ex-infinity functor we obtain a new and combinatorial proof that it is a weak homotopy equivalence. Moreover, we obtain a presentation of it as a…
It is shown that any denumerable list L to which Cantor's diagonal method was applied is incomplete. However, this doesn't allow us to affirm that the cardinality of the real numbers of the interval [0, 1] is greater than the cardinality of…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
We apply the topology of convergence on compact sets to define unpredictable functions [5, 6]. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and…
The best developed formulation of closed system quantum theory that handles multiple-time statements, is the consistent (or decoherent) histories approach. The most important weaknesses of the approach is that it gives rise to many…
A number of phenomena generally believed characteristic of quantum mechanics and seen as interpretively problematic--the incompatibility and value-indeterminacy of variables, the non-existence of dispersion-free states, the failure of the…
Several properly countable unions of algebraic sets in $\mathbb{C}^n$ are definable in $\mathbb{C}(t)$ including the set CM of $j$-invariants of complex elliptic curves with complex multiplication. It has been suggested that one could prove…
This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…
Although the suspicion that quantum mechanics is emergent has been lingering for a long time, only now we begin to understand how a bridge between classical and quantum mechanics might be squared with Bell's inequalities and other…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
For the classical power indices there is a disproportion between power and relative weights, in general. We introduce two new indices, based on weighted representations, which are proportional to suitable relative weights and which also…
A common objection to the definition of intuitionistic implication in the Proof Interpretation is that it is impredicative. I discuss the history of that objection, argue that in Brouwer's writings predicativity of implication is ensured…
There is a well-known equivalence between avoiding accuracy dominance and having probabilistically coherent credences (see, e.g., de Finetti 1974, Joyce 2009, Predd et al. 2009, Schervish et al. 2009, Pettigrew 2016). However, this…
The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…
A system's apparent simplicity depends on whether it is represented classically or quantally. This is not so surprising, as classical and quantum physics are descriptive frameworks built on different assumptions that capture, emphasize, and…