Skip to main content
Springer Nature Link
Log in

Set-Theoretic Absoluteness and the Revision Theory of Truth

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

We describe the solution of the Limit Rule Problem of Revision Theory and discuss the philosophical consequences of the fact that the truth set of Revision Theory is a complete Π1/2 set.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Antonelli, A.G., 'The complexity of revision', Notre Dame Journal of Formal Logic 35 (1994), p. 67-72.

    Google Scholar 

  2. Antonelli, G.A., 'The complexity of revision, revised', unpublished notes, 1998.

  3. Belnap Jr., N.D., 'Gupta's rule of revision theory of truth', Journal of Philosophical Logic 11 (1982), p. 103-116.

    Google Scholar 

  4. Burgess, J.P., 'The truth is never simple', Journal of Symbolic Logic 51 (1986), p. 663-681.

    Google Scholar 

  5. Chapuis, A., 'Alternate revision theories of truth', Journal of Philosophical Logic 25 (1996), p. 399-423.

    Google Scholar 

  6. Devlin, K., Constructibility, Berlin 1984 (Perspectives in Mathematical Logic).

  7. Friedman, H., 'Minimality in the Δ 12 -degrees', Fundamenta Mathematicæ 81 (1974), p. 183-192.

    Google Scholar 

  8. Gupta, A., 'Truth and paradox', Journal of Philosophical Logic 11 (1982), p. 1-60.

    Google Scholar 

  9. Gupta, A., N. Belnap, The Revision Theory of Truth, Cambridge MA 1993.

  10. Hamkins, J.D., A. Lewis, 'Infinite time Turing machines', Journal of Symbolic Logic 65 (2000), p. 567-604.

    Google Scholar 

  11. Herzberger, H.G., 'Notes on naive semantics', Journal of Philosophical Logic 11 (1982), p. 61-102.

    Google Scholar 

  12. Kremer, P., 'The Gupta-Belnap systems S # and S * are not axiomatisable,' Notre Dame Journal of Formal Logic 34 (1993), p. 583-596.

    Google Scholar 

  13. LÖwe, B., 'Revision sequences and computers with an infinite amount of time', Journal of Logic and Computation 11 (2001), p. 25-40 (also to appear in H. Wansing (ed.), 'Essays on non-classical logic', Invited Papers of the Workshop 'Nicht-klassische Formen der Logik' at the XVIII. Deutscher Kongreβ fÜr Philosophie in Konstanz 1999).

  14. Rogers, Jr., H., Theory of Recursive Functions and Effective Computability, Maidenhead (Berksh.) 1967.

  15. Shoenfield, J.R., Mathematical Logic, Reading MA 1967.

  16. Welch, P.D., 'The length of infinite time Turing machine computations', Bulletin of the London Mathematical Society 32 (2000), p. 129-136

    Google Scholar 

  17. Welch, P.D., 'Eventually infinite time Turing machine degrees: Infinite time decidable reals', Journal of Symbolic Logic 65 (2000), p. 1193-1203.

    Google Scholar 

  18. Welch, P.D. 'On Gupta-Belnap revision theories of truth, Kripkean fixed points, and the next stable set', to appear in Bulletin of Symbolic Logic 7 (2001).

  19. Welch, P.D., 'On revision operators', (in preparation).

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität Bonn, Beringstraße 6, D-53115, Bonn, Germany

    Benedikt Löwe

  2. School of Mathematics, University of Bristol, Clifton, Bristol, BS8 1TW, UK

    Philip D. Welch

  3. Graduate School of Science & Technology, Kobe University, 657, Rokko-dai, Nada-ku, Kobe, Japan

    Philip D. Welch

Authors
  1. Benedikt Löwe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philip D. Welch
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Löwe, B., Welch, P.D. Set-Theoretic Absoluteness and the Revision Theory of Truth. Studia Logica 68, 21–41 (2001). https://doi.org/10.1023/A:1011946004905

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011946004905