| viXra.org > Set Theory and Logic > 2312 |
 |
 |
| viXra.org > Set Theory and Logic > 2312 |
|
|
[5] viXra:2312.0148 [pdf] submitted on 2023-12-28 18:34:55
Authors: Ryan J. Buchanan
Comments: 11 Pages.
This is a rendition of [2]. We study stringy motivic structures. This builds upon work dealing with $mathbb{F}_p$-modives for a suitable prime p. In our case, we let p be a long exact sequence spanning a path in a pre-geometric space. We superize a nerve from our previous study.
Category: Set Theory and Logic
[4] viXra:2312.0120 [pdf] submitted on 2023-12-23 01:56:11
Authors: Hongyi Li
Comments: 5 Pages.
The finite and infinite decimals of binary are listed one by one at the same time, thus completely proving that the real numbers are countable. This paper will completely rewrite the history of mathematics. Because there are lots of errors in Cantor's theory, and the uncountability of real numbers is only one of them, it is necessary to launch a campaign to crack down on false and correct errors, lest these errors continue to destroy the normal capacity of human thinking and continue to mislead people.
Category: Set Theory and Logic
[3] viXra:2312.0092 [pdf] submitted on 2023-12-17 08:58:52
Authors: Marat Faizrahmanov
Comments: 14 Pages.
In this paper, we prove a joint generalization of Arslanov’s completenesscriterion and Visser’s ADN theorem for precomplete numberings. Then we considerthe properties of completeness and precompleteness of numberings in the context ofthe positivity property. We show that the completions of positive numberings are nottheir minimal covers and that the Turing completeness of any set A is equivalent to theexistence of a positive precomplete A-computable numbering of any infinite family withpositive A-computable numbering.
Category: Set Theory and Logic
[2] viXra:2312.0091 [pdf] submitted on 2023-12-17 23:36:55
Authors: Wolfgang Mückenheim
Comments: 3 Pages. (Correction made by viXra Admin to conform with scholarly norm)
Seven internal contradictions of set theory are discussed.
Category: Set Theory and Logic
[1] viXra:2312.0087 [pdf] submitted on 2023-12-17 15:35:50
Authors: Marat Faizrahmanov
Comments: 13 Pages.
The paper studies Σ-0-n-computable families (n ⩾ 2) and their numberings. It is proved that any non-trivial Σ-0-n-computable family has a complete with respect to any of its elements Σ-0-n-computable non-principal numbering. It is established that if a Σ-0-n-computable family is not principal, then any of its Σ-0-n-computable numberings has a minimal cover.
Category: Set Theory and Logic
| Third-Party Links: |
|