Rosser orderings and free variables

Studia Logica 50 (1):71 - 80 (1991)
  Copy   BIBTEX

Abstract

It is shown that for arithmetical interpretations that may include free variables it is not the Guaspari-Solovay system R that is arithmetically complete, but their system R –. This result is then applied to obtain the nonvalidity of some rules under arithmetical interpretations including free variables, and to show that some principles concerning Rosser orderings with free variables cannot be decided, even if one restricts oneself to usual proof predicates.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
31 (#726,424)

6 months
5 (#1,037,427)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dick De De Jongh
University of Amsterdam

Citations of this work

A small reflection principle for bounded arithmetic.Rineke Verbrugge & Albert Visser - 1994 - Journal of Symbolic Logic 59 (3):785-812.
Efficient Metamathematics. Rineke - 1993 - Dissertation, Universiteit van Amsterdam

Add more citations

References found in this work

Rosser sentences.D. Guaspari - 1979 - Annals of Mathematical Logic 16 (1):81.

Add more references