[2] ai.viXra.org:2604.0081 [pdf] submitted on 2026-04-25 19:49:33
Authors: Kesan Yi
Comments: 3 Pages. (Note by ai.viXra.org Admin: Please cite listed scientific references)
This paper re-examines the logical foundations of Cantor's diagonal argument. By constructing a countable set S that includes a transfinite limit element under the framework of actual infinity, we demonstrate a paradox: a strictly defined sequential ordering leads the diagonal argument to classify a countable set as uncountable. This paper argues that Cantor's proof relies on two critical implicit assumptions: the completed totality of natural numbers and the presumed invariance of the result across all possible permutations. We conclude that the diagonal argument may reflect the limitations of finite indexing rather than the intrinsic cardinality of the set.
Category: General Mathematics
[1] ai.viXra.org:2604.0051 [pdf] submitted on 2026-04-12 16:46:12
Authors: Parker Emmerson, Ryan J. Buchanan
Comments: 26 Pages.
We study exact witness architectures, sentences or semantic classes equipped with distinguished exact witness channels. The main theorem is a selection jump: for every decidable local verifier, any nonempty stagewise-local success class is automatically $Pi^0_2$-complete. Thus a single successful seed already forces maximal stagewise complexity. Around this theorem we prove three further barrier layers. Finite stagewise prefixes are uniformly insufficient, and undecidable co-c.e. witness architectures admit no decidable one-shot positive certifier and no exact-domain compiler. Same-theory adequacy along a universal $Pi_1$ embedding yields full $Pi_1$ reflection, ruling out internal exact certification in consistent recursively axiomatizable extensions of $ISone$. Finally, an arithmetic exact terminality predicate exists on a truth-faithfully embedded fragment exactly when the fragment truth set is arithmetical, yielding Tarski and diagonal barriers. For fixed propositions with exact two-sided decidable witness packages, these results assemble into a bridge trichotomy: isolated extensional bridges are vacuous, effective bridge classes are empty or $Pi^0_2$-complete, and assertion-enriched resolver layers are truth-universal.
Category: General Mathematics