Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-28T15:17:39.611Z Has data issue: false hasContentIssue false

Calculating self-referential statements: Guaspari sentences of the first kind

Published online by Cambridge University Press:  12 March 2014

C. Smoryński*
Affiliation:
Bar-Ilan University, Ramat-Gan, Israel

Extract

Beginning in 1960, and continuing for about a decade and a half, Shepherdson's self-referential formulae dominated the applications of diagonalization in metamathematics. In 1976, it was doubly toppled from its position of supremacy by two demonstrably more powerful such sentences introduced by D. Guaspari. The goal of the present note is to understand and explain the first (and, for the time being, more important) of Guaspari's self-referential sentences, which we dub “Guaspari sentences of the first kind”, or, less poetically, “Guaspari fixed points”.

Both Shepherdson's and Guaspari's fixed points are generalizations of the Rosser sentence. But, where Shepherdson merely tacks on side-formulae, Guaspari takes a more revolutionary step: He views the basic components, PrT(⌈¬φ⌉) and PrT(⌈φ⌉), of the Rosser sentence as attempts to refute something and replaces them by refutations of something else. Ignoring their Shepherdsonesque side-formulae (tacked on for the sake of more esoteric applications), our analysis of Guaspari fixed points can be viewed as merely the isolation of those properties whose refutations can be used in this context.

In §1 we offer the outcome of this analysis—i.e. a delineation of properties whose refutations can so be used. Some simple examples are cited and the Guaspari fixed points are defined. The main theorem—a master Fixed Point Calculation—is proven in §2.

Type
Research Article
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

[1]Guaspari, D., Partially conservative extensions of arithmetic, Transactions of the American Mathematical Society, vol. 254 (1979), pp. 4768.CrossRefGoogle Scholar
[2]Hájek, P., On interpretability in set theories, Commentationes Mathematicae Universitatis Carolinae, vol. 12 (1971), pp. 7379.Google Scholar
[3]Hájek, P., On partially conservative extensions of arithmetic, Logic Colloquium '78 (Boffa, M., van Dalen, D. and McAloon, K., Editors), North-Holland, Amsterdam, 1979.Google Scholar
[4]Jensen, D. and Ehrenfeucht, A., Some problem in elementary arithmetics, Fundamenta Mathematicae, vol. 92 (1976), pp. 223245.CrossRefGoogle Scholar
[5]Shepherdson, J., Representability of recursively enumerable sets in formal theories, Archiv für Mathematische Logik und Grundlagenforschung, vol. 5 (1960), pp. 119127.CrossRefGoogle Scholar
[6]Smoryński, C., Calculating self-referential statements: non-explicit calculations, Fundamenta Mathematicae (to appear).Google Scholar
[7]Solovay, R., On interpretability in set theories (to appear).Google Scholar