Related papers: Formal Proof of the Weak Goodstein Theorem
We report about significant enhancements of the complex algebraic geometry theorem proving subsystem in GeoGebra for automated proofs in Euclidean geometry, concerning the extension of numerous GeoGebra tools with proof capabilities. As a…
In this paper we prove Chaitin's ``heuristic principle'', {\it the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself}, for an appropriate measure of complexity. We show that the measure is…
We prove that algebras are left weakly Gorenstein in case the subcategory $^{\perp}A \cap \Omega^n(A)$ is representation-finite. This applies in particular to all monomial algebras and endomorphism algebras of modules over…
The goal of this article is to clarify some misunderstandings and inappropriate claims made in [6] regarding the relation between the weak Galerkin (WG) finite element method and the hybridizable discontinuous Galerkin (HDG). In this paper,…
This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long…
We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…
In this paper, we propose a weak regularity principle which is similar to both weak K\"onig's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then…
Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…
The weak value amplification technique has been proved useful for precision metrology in both theory and experiment. To explore the ultimate performance of weak value amplification for multi-parameter estimation, we investigate a general…
The theory of weak measurement, proposed by Aharonov and coworkers, has been applied by Steinberg to the long-discussed traversal time problem. The uncertainty and ambiguity that characterize this concept from the perspective of von Neumann…
The core challenge in a Hoare- or Dijkstra-style proof system for graph programs is in defining a weakest liberal precondition construction with respect to a rule and a postcondition. Previous work addressing this has focused on assertion…
Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various…
In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…
In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…
A new viewpoint of the G\"odel's incompleteness theorem be given in this article which reveals the deep relationship between the logic and computation. Upon the results of these studies, an algorithm be given which shows how to search a…
In considering the reliability of numerical programs, it is normal to "limit our study to the semantics dealing with numerical precision" (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that…
We introduce, for every $\mathbb{Z}$-graded manifold, a formal exponential map defined in a purely algebraic way and study its properties. As an application, we give a simple new construction of a Fedosov type resolution of the algebra of…
Goodstein's principle is arguably the first purely number-theoretic statement known to be independent of Peano arithmetic. It involves sequences of natural numbers which at first appear to grow very quickly, but eventually decrease to zero.…
The purpose of this paper is to describe a unified approach to proving vector-valued inequalities without relying on the full strength of weighted theory. Our applications include the Fefferman-Stein and Cordoba-Fefferman inequalities, as…