English
Related papers

Related papers: On Godel's "Much Weaker" Assumption

200 papers

In this paper we show that it is relatively consistent with ZFC that every gamma-set is countable while not every strong measure zero set is countable. This answers a question of Paul Szeptycki. A set is a gamma-set iff every omega-cover…

Logic · Mathematics 2007-05-23 Arnold W. Miller

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the…

Logic · Mathematics 2023-07-12 Samuel Allen Alexander , Arthur Paul Pedersen

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

Logic · Mathematics 2024-03-21 Dag Normann , Sam Sanders

We prove that the MSO+U logic is compositional in the following sense: whether an MSO+U formula holds in a tree T depends only on MSO+U-definable properties of the root of T and of subtrees of T starting directly below the root. Another…

Logic in Computer Science · Computer Science 2020-05-07 Paweł Parys

We introduce and study several notions of computability-theoretic reducibility between subsets of $\omega$ that are "robust" in the sense that if only partial information is available about the oracle, then partial information can be…

Logic · Mathematics 2014-06-12 Damir Dzhafarov , Gregory Igusa

We offer a mathematical proof of consistency for Peano Arithmetic PA formalizable in PA. This result is compatible with Goedel's Second Incompleteness Theorem since our consistency proof does not rely on the representation of consistency as…

Logic · Mathematics 2020-06-23 Sergei Artemov

This article examines the formula G (of Goedel). We demonstrated that the Goedel's number of the formula G is not a finite number if (i) G is comprehended as a self-referential statement or (ii) there is an infinite set S of well-formed…

General Mathematics · Mathematics 2023-02-23 Jailton C. Ferreira

We investigate the proof theory of regular expressions with fixed points, construed as a notation for (omega-)context-free grammars. Starting with a hypersequential system for regular expressions due to Das and Pous, we define its extension…

Logic in Computer Science · Computer Science 2024-04-26 Anupam Das , Abhishek De

Uniform metastable convergence is a weak form of uniform convergence for a family of sequences. In this paper we explore the way that metastable convergence stratifies into a family of notions indexed by countable ordinals. We give two…

Logic · Mathematics 2017-10-03 Henry Towsner

We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Phi|| for sentences…

Logic · Mathematics 2016-11-16 Douglas Ulrich , Richard Rast , Michael C. Laskowski

This paper is concerned with the apparent greatest weakness of the Mathematical Theory of Evidence (MTE) of Shafer \cite{Shafer:76}, which has been strongly criticized by Wasserman \cite{Wasserman:92ijar}. Weaknesses of Shafer's proposal…

Artificial Intelligence · Computer Science 2018-11-13 Mieczysław Kłopotek

We prove that if $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are countable models of the theory $\mathrm{WKL}^*_0$ such that $\mathrm{I}\Sigma_1(A)$ fails for some $A \in \mathcal{X} \cap \mathcal{Y}$, then $(M,\mathcal{X})$ and…

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…

Logic · Mathematics 2026-03-10 Sven Manthe

The generally accepted wisdom in computational circles is that pure proof verification is a solved problem and that the computationally hard elements and fertile areas of study lie in proof discovery. This wisdom presumably does hold for…

Logic in Computer Science · Computer Science 2017-03-28 Naveen Sundar Govindarajulu , Selmer Bringsjord

Hilbert and Ackermann asked for a method to consistently extend incomplete theories to complete theories. G\"odel essentially proved that any theory capable of encoding its own statements and their proofs contains statements that are true…

Artificial Intelligence · Computer Science 2023-10-31 Dusko Pavlovic , Temra Pavlovic

The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…

Logic · Mathematics 2016-02-10 François G. Dorais

In the lecture notes it is shown that an ordinal $\psi_{\Omega}(\varepsilon_{\mathbb{S}^{+}+1})$ is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\omega+(M\prec_{\Sigma_{1}}V)$. In this note we show that ${\sf…

Logic · Mathematics 2023-04-11 Toshiyasu Arai

The average result of a weak measurement of some observable $A$ can, under post-selection of the measured quantum system, exceed the largest eigenvalue of $A$. The nature of weak measurements, as well as the presence of post-selection and…

Quantum Physics · Physics 2014-11-13 Matthew F. Pusey

Ordinal analysis induces a partition of $\Sigma^1_1$-definable and $\Pi^1_1$-sound theories whereby two theories are equivalent if they have the same proof-theoretic ordinal. We show that no equivalence relation $\equiv$ is finer than the…

Logic · Mathematics 2022-09-22 James Walsh

As an approach to a Theory of Everything a framework for developing a coherent theory of mathematics and physics together is described. The main characteristic of such a theory is discussed: the theory must be valid and and sufficiently…

Quantum Physics · Physics 2007-05-23 Paul Benioff