相关论文: Three beliefs that lend illusory legitimacy to Can…

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

It is a ubiquitous opinion among mathematicians that a real number is just a point in the line. If this rough definition is not enough, then a mathematician may provide a formal definition of the real numbers in the set theoretic and…

If we define classical foundational concepts constructively, and introduce non-algorithmic effective methods into classical mathematics, then we can bridge the chasm between truth and provability, and define computational methods that are…

Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…

Quantum theory may be formulated using Hilbert spaces over any of the three associative normed division algebras: the real numbers, the complex numbers and the quaternions. Indeed, these three choices appear naturally in a number of…

This text tries to give an elementary introduction to the mathematical properties of infinite sets. The aim is to keep the approach as simple as possible. Advanced knowledge of mathematics is not necessary for a proper understanding, and…

The diagonal method is often used to show that Turing machines cannot solve their own halting problem. There have been several recent attempts to show that this method also exposes either contradiction or arbitrariness in other theoretical…

We conclude from Goedel's Theorem VII of his seminal 1931 paper that every recursive function f(x_{1}, x_{2}) is representable in the first-order Peano Arithmetic PA by a formula [F(x_{1}, x_{2}, x_{3})] which is algorithmically verifiable,…

This paper revisits the foundations of mathematical proof through the lens of Aristotle's threefold conception of truth: sensory evidence, axiomatic definition, and syllogistic deduction. I argue that modern mathematics has too often…

Let $n$ be the maximal nilpotent subalgebra of a simple complex Lie algebra $g$. We introduce the notion of imaginary vector in the dual canonical basis of $U_q(n)$, and we give examples of such vectors for types $A_n (n\ge 5)$, $B_n (n\ge…

We determine the sets definable in expansions of the ordered real additive group by generalized Cantor sets. Given a natural number $r\geq 3$, we say a set $C$ is a generalized Cantor set in base $r$ if there is a non-empty…

Hilbert's first problem is of importance in relation to work being done in computational systems. It is the question of equipollence of natural and real numbers. By construction equipollence is established for real numbers in open interval…

We prove in constructive logic that the statement of the Cantor-Bernstein theorem implies excluded middle. This establishes that the Cantor-Bernstein theorem can only be proven assuming the full power of classical logic. The key ingredient…

By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…

Based on the MRDP theorem concerning the Hilbert tenth problem, there is a corresponding Diophantine equation called proof equation for every formula of the First-order Peano Arithmetic (PA). A formula is provable in PA, if and only if the…

The best mathematical arguments against a realistic interpretation of quantum mechanics - that gives definite but partially unknown values to all observables - are analysed and shown to be based on reasoning that is not compelling. This…

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

The Turing machine (TM) and the Church thesis have formalized the concept of computable number, this allowed to display non-computable numbers. This paper defines the concept of number "approachable" by a TM and shows that some (if not all)…

It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…