A theorem on shortening the length of proof in formal systems of arithmetic

Journal of Symbolic Logic 40 (3):398-400 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272163

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A theorem on shortening the length of proof in formal systems of arithmetic.Robert A. di Paola - 1975 - Journal of Symbolic Logic 40 (3):398-400.
On me number of steps in proofs.Jan Krajíèek - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.
On the number of steps in proofs.Jan Kraj\mIček - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.
Hindman's theorem: An ultrafilter argument in second order arithmetic.Henry Towsner - 2011 - Journal of Symbolic Logic 76 (1):353 - 360.
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
On the correspondence between arithmetic theories and propositional proof systems – a survey.Olaf Beyersdorff - 2009 - Mathematical Logic Quarterly 55 (2):116-137.
Proof Mining in Topological Dynamics.Philipp Gerhardy - 2008 - Notre Dame Journal of Formal Logic 49 (4):431-446.
Nonstandard second-order arithmetic and Riemannʼs mapping theorem.Yoshihiro Horihata & Keita Yokoyama - 2014 - Annals of Pure and Applied Logic 165 (2):520-551.
About Goodmanʼs Theorem.Thierry Coquand - 2013 - Annals of Pure and Applied Logic 164 (4):437-442.
Nonstandard Models and Kripke's Proof of the Gödel Theorem.Hilary Putnam - 2000 - Notre Dame Journal of Formal Logic 41 (1):53-58.
Propositional proof systems, the consistency of first order theories and the complexity of computations.Jan Krajíček & Pavel Pudlák - 1989 - Journal of Symbolic Logic 54 (3):1063-1079.
The Intimate Relationship Between the McNaughton and the Chinese Remainder Theorems for MV-algebras.Eduardo J. Dubuc & Yuri Poveda - 2013 - Studia Logica 101 (3):483-485.
A Simple Proof of Parsons' Theorem.Fernando Ferreira - 2005 - Notre Dame Journal of Formal Logic 46 (1):83-91.

Analytics

Added to PP
2017-06-18

Downloads
12 (#1,058,801)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Review: Alfred Tarski, Undecidable Theories. [REVIEW]Martin Davis - 1959 - Journal of Symbolic Logic 24 (2):167-169.

Add more references