Related papers: A generic absoluteness principle consistent with l…
We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…
We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.
There is new experimental evidence which may be interpreted as a small departure from quark-lepton universality. We propose to understand this as the result of a hierarchy of mass scales in analogy to $m_u, m_d << \Lambda_{QCD}$ for strong…
We present a general fixed point theorem which can be seen as the quintessence of the principles of proof for Banach's Fixed Point Theorem, ultrametric and certain topological fixed point theorems. It works in a minimal setting, not…
A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more…
Modern machine learning models are deployed in diverse, non-stationary environments where they must continually adapt to new tasks and evolving knowledge. Continual fine-tuning and in-context learning are costly and brittle, whereas neural…
We generalize Harrington-Marker-Shelah's Dilworth-style characterization of the existence of non-empty perfect antichains to co-analytic quasi-orders, establish the analogous theorem at the next definable cardinal, and consider…
Multiprocess systems, including grid systems, multiprocessors and multicore computers, incorporate a variety of specialized hardware and software mechanisms, which speed computation, but result in complex memory behavior. As a consequence,…
The generalized uncertainty principle of string theory is derived in the framework of Quantum Geometry by taking into account the existence of an upper limit on the acceleration of massive particles.
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
We compare three notions of genericity of separable metric structures. Our analysis provides a general model theoretic technique of showing that structures are generic in descriptive set theoretic (topological) sense and in measure…
Classifying the training data correctly without over-fitting is one of the goals in machine learning. In this paper, we propose a generalization-memorization mechanism, including a generalization-memorization decision and a memory modeling…
The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous…
G\"odel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit…
This paper builds on no-go theorems to the effect that quantum theory is inconsistent with observations being absolute; that is, unique and non-relative. Unlike the existing no-go results, the one introduced here is based on a…
We explore the algebraic properties of a generalized version of the iterated-sums signature, inspired by previous work of F.~Kir\'aly and H.~Oberhauser. In particular, we show how to recover the character property of the associated linear…
Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
The purpose of this paper is to introduce and investigate a new system of global fractional-order interval implicit projection neural networks. An existence and uniqueness theorem of the equilibrium point for such kind of global…
In the modern Bayesian view classical probability theory is simply an extension of conventional logic, i.e., a quantitative tool that allows for consistent reasoning in the presence of uncertainty. Classical theory presupposes, however,…