Hostname: page-component-8448b6f56d-xtgtn Total loading time: 0 Render date: 2024-04-25T05:59:31.068Z Has data issue: false hasContentIssue false
  • English
  • Français

A result on implications of Σ1-sentences and its application to normal form theorems

Published online by Cambridge University Press:  12 March 2014

Jean-Yves Girard  and
Peter Päppinghaus
Jean-Yves Girard
Affiliation:
Universität Hannover, D-3000 Hannover, Federal Republic of Germany
Peter Päppinghaus
Affiliation:
Université Paris VII, 75221 Paris, Cedex 05, France
Get access Rights & Permissions [Opens in a new window]

Extract

In this paper we are concerned with the formal provability of certain true implications of Σ1-sentences. Old completeness and incompleteness results already give some information about this. For example by Σ1-completeness of PRA (primitive recursive arithmetic) every true implication of the form D → E, where D is a Σ0-sentence and E a Σ1-sentence, or D a Σ1-sentence and E a true Σ1-sentence, is provable in PRA. On the other hand, by Gödel's incompleteness theorems one can define for every suitable theory S a false Σ1-sentence Ds such that for every false Σ0-sentence E the true implication Ds → E is not provable in S, but is provable in PRA + Cons. So one sees that for a suitable fixed conclusion the provability of true implications of Σ1-sentences depends on the content of the premise.

Now we ask, if and how for a suitable fixed premise the provability of true implications of Σ1-sentences depends on the conclusion. As remarked above, by Σ1-completeness of PRA this question is settled, if the premise is true. For a false premise it is answered in § 1 as follows: Let D be a false Σ1-sentence, S an extension of PRA, and S+ ≔ PRA + IAΣ1 + RFNΣ1S). Depending on D and S one can define a Σ1-sentence Es such that S+ ⊢ D → Es, but S ⊬ D → Es provided that S+ is not strong enough to refute D. (IAΣ1 denotes the scheme of the induction axiom for Σ1-formulas, and RFNΣ1(S) the uniform Σ1-reflection principle for S.)

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 46 , Issue 3 , September 1981 , pp. 634 - 642
Copyright
Copyright © Association for Symbolic Logic 1981

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

[Gi]Girard, J.-Y., Three-valued logic and cut-elimination: The actual meaning of Takeuti's conjecture, Dissertationes Mathematicae, no. 136, Warsaw, 1976.Google Scholar
[KT]Kreisel, G. and Takeuti, G., Formally self-referential propositions for cut free classical analysis and related systems, Dissertationes Mathematicae, no. 118, Warsaw, 1974.Google Scholar
[Pä 1]Päppinghaus, P., Existentiell schwache Vollständigkeit der Logik zweiter Stufe und Schnittelimination, Dissertation, University of Heidelberg, 1977.Google Scholar
[Pä 2]Päppinghaus, P., Completeness properties of classical theories of finite type and the normal form theorem, Dissertationes Mathematicae, no. 207 (to appear).Google Scholar
[Pä 3]Päppinghaus, P., A version of the Σ 1reflection principle for CFA provable in PRA, Archiv für Mathematische Logik und Grundlagenforschung, vol. 20 (1980), pp. 27–40.CrossRefGoogle Scholar
[Pa]Parsons, C., On a number theoretic choice schema and its relation to induction, Intuitionism and proof theory (Kino, , Myhill, , Vesley, , Editors), Proceedings of the Summer Conference at Buffalo, New York, 1968, North-Holland, Amsterdam, 1970, pp. 459–473.Google Scholar
[Sch]Schwichtenberg, H., Some applications of cut-elimination, Handbook of mathematical logic (Barwise, J., Editor), North-Holland, Amsterdam, 1977, pp. 867–895.CrossRefGoogle Scholar
[Sm]Smoryński, C., The incompleteness theorems, Handbook of mathematical logic (Barwise, J., Editor), North-Holland, Amsterdam, 1977, pp. 821–865.CrossRefGoogle Scholar