相关论文: Foundations of Mathematics

This book intends to give the main definitions and theorems in mathematics which could be useful for workers in theoretical physics. It gives an extensive and precise coverage of the subjects which are addressed, in a consistent and…

Algorithmic meta-theorems are general algorithmic results applying to a whole range of problems, rather than just to a single problem alone. They often have a "logical" and a "structural" component, that is they are results of the form:…

Since its existence, the computer tool has often supported mathematicians, whether it is to implement an approximation method (numerical calculation of a root, of an integral, ...) or to simulate a phenomenon (geometric in nature,…

A description of physical reality in which wholeness is the foundation is discussed along with the motivation for such an attempt. As a possible mathematical framework within which a physical theory based on wholeness may be expressed,…

In this paper we sketch how some fundamental concepts of modern topology (as well as logic and category theory) can be understood philosophically in the light of Hegel's Science Logic as well how modern topological concepts can provide…

The paper elaborates an endeavor on applying the algorithmic information-theoretic computational complexity to meta-social-sciences. It is motivated by the effort on seeking the impact of the well-known incompleteness theorem to the…

This article supports the epistemological claim that sound human reasoning about ultimate knowledge is either foundational or circularly justified. In particular, questions which naturally arise in theology, philosophy, and related…

This article was motivated by the discovery of a potential new foundation for mainstream mathematics. The goals are to clarify the relationships between primitives, foundations, and deductive practice; to understand how to determine what…

A century ago, discoveries of a serious kind of logical error made separately by several leading mathematicians led to acceptance of a sharply enhanced standard for rigor within what ultimately became the foundation for Computer Science. By…

As David Berlinski writes (1997), the existence and nature of mathematics is a more compelling and far deeper problem than any of the problems raised by mathematics itself. Here we analyze the essence of mathematics making the main emphasis…

The halting probability of a Turing machine is the probability that the machine will halt if it starts with a random stream written on its one-way input tape. When the machine is universal, this probability is referred to as Chaitin's omega…

J. Hadamard's ideas about the correct formulation of the problems of mathematical physics have been analyzed. In this connection various interpretations of the directly related Banach theorem about the inverse operator has been touched. The…

I'll discuss how Goedel's paradox "This statement is false/unprovable" yields his famous result on the limits of axiomatic reasoning. I'll contrast that with my work, which is based on the paradox of "The first uninteresting positive whole…

Recent progress in artificial intelligence (AI) is unlocking transformative capabilities for mathematics. There is great hope that AI will help solve major open problems and autonomously discover new mathematical concepts. In this essay, we…

We define instantiational and algorithmic completeness for a formal language. We show that, in the presence of Church's Thesis, an alternative interpretation of Goedelian incompleteness is that Peano Arithmetic is instantiationally…

In 1927 Heisenberg discovered that the ``more precisely the position is determined, the less precisely the momentum is known in this instant, and vice versa''. Four years later G\"odel showed that a finitely specified, consistent formal…

The paper explores known results related to the problem of identifying if a given program terminates on all inputs -- this is a simple generalization of the halting problem. We will see how this problem is related and the notion of proof…

This short note is intended to review the foundations of mechanics, trying to present them with the greatest mathematical and conceptual clarity. It was attempted to remove most of inessential, even parasitic issues, which can hide the true…

Mathematical proofs are both paradigms of certainty and some of the most explicitly-justified arguments that we have in the cultural record. Their very explicitness, however, leads to a paradox, because the probability of error grows…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…