Hostname: page-component-5cf477f64f-tx7qf Total loading time: 0 Render date: 2025-04-08T01:07:46.255Z Has data issue: false hasContentIssue false
  • English
  • Français

Kreisel's Conjecture with minimality principle

Published online by Cambridge University Press:  12 March 2014

Pavel Hrubeš
Pavel Hrubeš*
Affiliation:
Institute for Advanced Study, Einstein Drive, Princeton, Nj 08540, USA, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove that Kreisel's Conjecture is true, if Peano arithmetic is axiomatised using minimality principle and axioms of identity (theory PAM). The result is independent on the choice of language of PAM. We also show that if infinitely many instances of A(x) are provable in a bounded number of steps in PAM then there exists . The results imply that PAM does not prove scheme of induction or identity schemes in a bounded number of steps.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 74 , Issue 3 , September 2009 , pp. 976 - 988
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Baaz, M. and Pudlák, P., Kreisels conjecture for LƎ1, Arithmetic, proof theory, and computational complexity (Papers from the Conference Held in Prague, July 2–5, 1991), Oxford Logic Guides, vol. 23, Oxford University Press, New York, 1993, pp. 30–60.Google Scholar
[2]Friedman, H., One hundred and two problems in mathematical logic, this Journal, vol. 40 (1975), pp. 113–129.Google Scholar
[3]Hrubeš, P., Theories very close to PA where Kreisel's conjecture is false, this Journal, vol. 72 (2007), pp. 123–137.Google Scholar
[4]Krajíček, J. and Pudlak, P., The number of proof lines and the size of proofs in first order logic, Archive for Mathematical Logic, vol. 27 (1988), pp. 69–84.CrossRefGoogle Scholar
[5]Miyatake, T., On the length of proofs in formal systems, Tsukuba Journal of Mathematics, vol. 4 (1980), pp. 115–125.CrossRefGoogle Scholar
[6]Parikh, R., Some results on the length of proofs, Transactions of the American Mathematical Society, vol. 177 (1973), pp. 29–36.CrossRefGoogle Scholar
[7]Yukami, T., A note on a formalized arithmetic with function symbols ′ and +, Tsukuba Journal of Mathematics, vol. 2 (1978), no. 7, pp. 69–73.CrossRefGoogle Scholar
[8]Yukami, T., Some results on speed-up, Annals of the Japan Association for Philosophy of Science, vol. 6 (1984), pp. 195–205.CrossRefGoogle Scholar