Related papers: Reviewing Goedel's and Rosser's meta-reasoning of …
It is well known that the incompressible Euler equations can be formulated in a very geometric language. The geometric structures provide very valuable insights into the properties of the solutions. Analogies with the finite-dimensional…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
We present the first class of mathematically rigorous, general, fully self-referential, self-improving, optimally efficient problem solvers. Inspired by Kurt Goedel's celebrated self-referential formulas (1931), such a problem solver…
We find the irreducible decomposition of the Weil representation of the unitary group $\mathrm{U}_{2n}(A)$, where $A$ is a ramified quadratic extension of a finite, commutative, local, principal ideal ring $R$ and the nilpotency degree of…
We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for…
Formal multiple zeta values allow to study multiple zeta values by algebraic methods in a way that the open question about their transcendence is circumvented. In this note we show that Hoffman's basis conjecture for formal multiple zeta…
We give a new construction of free distributive p-algebras. Our construction relies on a detailed description of completely meet-irreducible congruences, so it is purely universal algebraic. It yields a normal form theorem for p-algebra…
It is known that for a uniform morphic sequence $\boldsymbol u = \langle u_n\rangle_{n=0}^\infty$ and an algebraic number $\beta$ such that $|\beta|>1$, the number $[\![\boldsymbol{u} ]\!]_\beta:=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$…
Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…
We articulate here a series of specific metagoals designed to address the challenge of creating AGI systems that possess the ability to flexibly self-modify yet also have the propensity to maintain key invariant properties of their goal…
In this paper, we argue that while the concept of a set-theoretic paradox (or paradoxical set) can be relatively well-defined within a formal setting, the concept of a set-theoretic hypodox (or hypodoxical set) remains significantly less…
Incomputability results in Formal Logic and the Theory of Computation (i.e., incompleteness and undecidability) have deep implications for the foundations of mathematics and computer science. Likewise, Social Choice Theory, a branch of…
This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…
A detailed exposition of foundations of a logic-algebraic model for reasoning with knowledge bases specified by propositional (Boolean) logic is presented. The model is conceived from the logical translation of usual derivatives on…
Irreducible representations are the building blocks of general, semisimple Galois representations \rho, and cuspidal representations are the building blocks of automorphic forms \pi of the general linear group. It is expected that when an…
Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given…
The 20th century has revealed two important limitations of scientific knowledge. On the one hand, the combination of Poincar\'e's nonlinear dynamics and Heisenberg's uncertainty principle leads to a world picture where physical reality is,…
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…
In this article we define and study a zeta function $\zeta_G$ - similar to the Hasse-Weil zeta function - which enumerates absolutely irreducible representations over finite fields of a (profinite) group $G$. The zeta function converges on…