Skip to main content
×
×
Home

On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set

  • P.D. Welch (a1) (a2)
Abstract

We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified (in terms of definitional complexity) account of varied revision sequences—as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.

Copyright
Corresponding author
E-mail: welch@kobe-u.ac.jp. Current address: Institut für Formale Logik, Währinger Str. 25, A-1090 Wien, Austria
References
Hide All
[1] Antonelli, G. A., A revision-theoretic analysis of the arithmetical hierarchy, Notre Dame Journal of Formal Logic, vol. 35 (1994), pp. 204208.
[2] Barwise, Jon, Admissible sets and structures, Perspectives in Mathematical Logic, Springer-Verlag, 1975.
[3] Belnap, Nuel, Gupta's rule of revision theory of truth, Journal of Philosophical Logic, vol. 11 (1982), pp. 103116.
[4] Burgess, John P., The truth is never simple, The Journal of Symbolic Logic, vol. 51 (1986), no. 3, pp. 663681.
[5] Chapuis, A., Alternate revision theories of truth, Journal of Philosophical Logic, vol. 25 (1996), pp. 399423.
[6] Friedman, H., Minimality in the -degrees, Fundamenta Mathematicae, vol. 81 (1974), pp. 183192.
[7] Gupta, A., Truth and paradox, Journal of Philosophical Logic, vol. 11 (1982), pp. 160.
[8] Gupta, A. and Belnap, N., The revision theory of truth, M. I. T. Press, Cambridge, 1993.
[9] Herzberger, H., Notes on naive semantics, Journal of Philosophical Logic, vol. 11 (1982), pp. 61102.
[10] Hinman, P. G., Recursion on abstract structures, The handbook of computability theory (Griffor, E., editor), Studies in Logic series, vol. 140, North-Holland, Amsterdam, 1999.
[11] Jech, T., Set theory, Pure and Applied Mathematics, Academic Press, New York, 1978.
[12] Kremer, P., The Gupta-Belnap systems S# and S* are not axiomatisable, Notre Dame Journal of Formal Logic, vol. 34 (1993), pp. 583596.
[13] Löwe, B., Revision sequences and computers with an infinite amount of time, Journal of Logic and Computation, vol. 11 (2001), pp. 2540.
[14] McGee, V., Truth, vagueness, and paradox: An essay on the logic of truth, Hackett, 1991.
[15] Moschovakis, Y., Elementary induction on abstract structures, Studies in Logic series, vol. 77, North-Holland, Amsterdam, 1974.
[16] Sheard, M., A guide to truth predicates in the modern era, The Journal of Symbolic Logic, vol. 59 (1994), no. 3, pp. 10321054.
[17] Visser, A., Semantics and the liar paradox, Handbook of philosophical logic (Gabbay, D. and Guenther, F., editors), Reidel Publishing Co., Dordrecht, 1989, pp. 617706.
[18] Welch, P. D., On revision operators.
[19] Welch, P. D., Eventually infinite time Turing degrees: infinite time decidable reals, The Journal of Symbolic Logic, vol. 65 (2000), no. 3, pp. 11931203.
[20] Yaqūb, A., The liar speaks the truth. A defense of the revision theory of truth, Oxford University Press, New York, 1993.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of Symbolic Logic
  • ISSN: 1079-8986
  • EISSN: 1943-5894
  • URL: /core/journals/bulletin-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed