中文
相关论文

相关论文: On Arithmetical Truth of the Self-Referential Sent…

200 篇论文

G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a…

逻辑 · 数学 2024-01-25 Hugo Herbelin , Danko Ilik

A formalisation of G\"odel's incompleteness theorems using the Isabelle proof assistant is described. This is apparently the first mechanical verification of the second incompleteness theorem. The work closely follows {\'S}wierczkowski…

逻辑 · 数学 2021-04-30 Lawrence C. Paulson

In the article 'Ordinal Logics and the Characterizations of the Informal Concept of Proof', Georg Kreisel poses the problem of assigning unique notations to recursive ordinals, and additionally suggests that the methods which are developed…

逻辑 · 数学 2017-03-17 Matthew Timothy Wright

The uncountability of the reals was first established by Cantor in what was later heralded as the first paper on set theory. Since the latter constitutes the official foundations of mathematics, the logical study of the uncountability of…

逻辑 · 数学 2026-04-10 Dag Normann , Sam Sanders

Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…

数论 · 数学 2024-01-09 Lior Bary-Soroker , David Hokken , Gady Kozma , Bjorn Poonen

This article explores the following methodological principle for theory construction in physics: if an ontological theory predicts two scenarios that are ontologically distinct but empirically indiscernible, then this theory should be…

物理学史与哲学 · 物理学 2019-09-11 Robert W. Spekkens

G\"odel's ontological proof has been analysed for the first-time with an unprecedent degree of detail and formality with the help of higher-order theorem provers. The following has been done (and in this order): A detailed natural deduction…

计算机科学中的逻辑 · 计算机科学 2017-09-05 Christoph Benzmüller , Bruno Woltzenlogel Paleo

Jakob Bernoulli, working in the late 17th century, identified a gap in contemporary probability theory. He cautioned that it was inadequate to specify force of proof (probability of provability) for some kinds of uncertain arguments. After…

人工智能 · 计算机科学 2018-09-10 Brian Shay , Patrick Brazil

The fundamental aim of the paper is to correct an harmful way to interpret a Goedel's erroneous remark at the Congress of Koenigsberg in 1930. Despite the Goedel's fault is rather venial, its misreading has produced and continues to produce…

历史与综述 · 数学 2022-09-15 Giuseppe Raguni

By nature, transmissible human knowledge is enumerable: every sentence, movie, audio record can be encoded in a sufficiently long string of 0's and 1's. The works of G\"odel, Turing and others showed that there are inherent limits and…

其他计算机科学 · 计算机科学 2020-01-30 Frédéric Prost

Let f be a G-function (in the sense of Siegel), and x be an algebraic number; assume that the value f(x) is a real number. As a special case of a more general result, we show that f(x) can be written as g(1), where g is a G-function with…

数论 · 数学 2011-06-23 Stéphane Fischler , Tanguy Rivoal

We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…

逻辑 · 数学 2014-02-20 Asaf Karagila

A simplified variant of G\"odel's ontological argument is presented. The simplified argument is valid already in basic modal logics K or KT, it does not suffer from modal collapse, and it avoids the rather complex predicates of essence…

计算机科学中的逻辑 · 计算机科学 2023-08-28 Christoph Benzmüller

For sets $A, B\subset \mathbb N$, their sumset is $A + B := \{a+b: a\in A, b\in B\}$. If we cannot write a set $C$ as $C = A+B$ with $|A|, |B|\geq 2$, then we say that $C$ is $\textit{irreducible}$. The question of whether a given set $C$…

Current concerns about reproducibility in many research communities can be traced back to a high value placed on empirical reproducibility of the physical details of scientific experiments and observations. For example, the detailed…

历史与综述 · 数学 2019-07-19 Charles T. Gray , Ben Marwick

Hilbert's Irreducibility Theorem is a cornerstone that joins areas of analysis and number theory. Both the genesis and genius of its proof involved combining real analysis and combinatorics. We try to expose the motivations that led Hilbert…

历史与综述 · 数学 2017-09-21 Mark B. Villarino , Bill Gasarch , Kenneth Regan

Counterfactual definiteness is supposed to underlie the Bell theorem. An old controversy exists among those who reject the theorem implications by rejecting counterfactual definiteness and those who claim that, since it is a direct…

量子物理 · 物理学 2021-08-04 Justo Pastor Lambare , Rodney Franco

This is an essay-review on a recently re-issued book of John Bell "Speakable and Unspeakable in Quantum Mechanics". The discussion concentrates around the Bell Theorem, its assumptions, consequences and frequent overinterpretations.

量子物理 · 物理学 2015-01-26 Marek Zukowski

On the 50th anniversary of Bell's monumental 1964 paper, there is still widespread misunderstanding about exactly what Bell proved. This misunderstanding derives in turn from a failure to appreciate the earlier arguments of Einstein,…

量子物理 · 物理学 2015-06-22 Tim Maudlin

According to Karl Popper assumptions are statements used to construct theories. During the construction of a theory whether the assumptions are either true or false turn out to be irrelevant in view of the fact that, actually, they gain…

经典物理 · 物理学 2014-12-09 Israel Perez
‹ 上一页 1 8 9 10 下一页 ›