中文
相关论文

相关论文: Paradoxes of Randomness

200 篇论文

Practicing mathematicians often assume that mathematical claims, when they are true, have good reasons to be true. Such a state of affairs is "unreasonable", in Wigner's sense, because basic results in computational complexity suggest that…

历史与综述 · 数学 2024-10-28 Simon DeDeo

I think we can agree that dealing with uncertainty is not easy. Probability is the main tool for dealing with uncertainty, and we know there are many probability-related puzzles and paradoxes. Here I describe a rather idiosyncratic…

其他统计学 · 统计学 2022-01-19 Yudi Pawitan

The fact that the famous Godel incompleteness theorem and the archetype of all logical paradoxes, that of the Liar, are related closely is, of course, not only well known, but is a part of the common knowledge of logician community.…

逻辑 · 数学 2007-05-23 G. Sereny

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…

历史与综述 · 数学 2025-09-01 Paul J. Jorion

Goedel's results have had a great impact in diverse fields such as philosophy, computer sciences and fundamentals of mathematics. The fact that the rule of mathematical induction is contradictory with the rest of clauses used by Goedel to…

综合数学 · 数学 2007-05-23 Diego Saa

It is a widespread belief that results like G\"odel's incompleteness theorems or the intrinsic randomness of quantum mechanics represent fundamental limitations to humanity's strive for scientific knowledge. As the argument goes, there are…

物理学史与哲学 · 物理学 2021-08-30 Markus P. Mueller

Consider the following story: A teacher announces to her students a test for the following week, such that the test will be ``surprising''. The students use this as the basis for a ``logical derivation'' and reach a contradiction, which…

逻辑 · 数学 2026-02-04 Martin Dietzfelbinger

The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…

逻辑 · 数学 2011-10-18 Alexander Shen

Paradoxes are interesting puzzles in philosophy and mathematics, and they could be even more fascinating, when turned into proofs and theorems. For example, Liar's paradox can be translated into a propositional tautology, and Barber's…

逻辑 · 数学 2022-05-10 Saeed Salehi

We re-examine the old question to what extent mathematics may be compared with a game. Mainly inspired by Hilbert and Wittgenstein, our answer is that mathematics is something like a rhododendron of language games, where the rules are…

历史与综述 · 数学 2025-08-08 Klaas Landsman , Kirti Singh

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,…

物理学史与哲学 · 物理学 2013-04-10 Fernando Sols

Not any geometry can be axiomatized. The paradoxical Godel's theorem starts from the supposition that any geometry can be axiomatized and goes to the result, that not any geometry can be axiomatized. One considers example of two close…

综合数学 · 数学 2007-09-24 Yuri A. Rylov

First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those…

逻辑 · 数学 2015-04-21 Matthias Baaz , Norbert Preining , Richard Zach

A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…

综合数学 · 数学 2011-12-23 Joseph W. Norman

Most work on computational complexity is concerned with time. However this course will try to show that program-size complexity, which measures algorithmic information, is of much greater philosophical significance. I'll discuss how one can…

历史与综述 · 数学 2007-05-23 G. J. Chaitin

G\"odel's argument for the First Incompleteness Theorem is, structurally, a proof by contradiction. This article intends to reframe the argument by, first, isolating an additional assumption the argument relies on, and then, second, arguing…

逻辑 · 数学 2020-07-02 Joachim Derichs

The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…

逻辑 · 数学 2021-11-30 Saeed Salehi

Defeasible statements are statements that are likely, or probable, or usually true, but may occasionally be false. Plausible reasoning makes conclusions from statements that are either facts or defeasible statements without using numbers.…

人工智能 · 计算机科学 2026-04-22 David Billington

Astrophysical paradoxes are the paradoxes of physics. The main motivation of a formulated paradox is clearly recognized in the scientific environment because the phenomenon of a paradox itself has become interesting. There is an explanation…

物理学史与哲学 · 物理学 2008-12-10 Dragoljub A. Cucic

Wittgenstein's paradoxical theses that unproved propositions are meaningless, proofs form new concepts and rules, and contradictions are of limited concern, led to a variety of interpretations, most of them centered on the rule-following…

历史与综述 · 数学 2022-06-24 Sergiy Koshkin
‹ 上一页 1 2 3 10 下一页 ›