On revision operators

Journal of Symbolic Logic

Volumn 68, Issue 2, 2003, Pages 689-711

  Welch, P D ^a,b,c  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b KOBE UNIVERSITY   (Japan)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037833488     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1052669071     Document Type: Article

References (22)

1. G. A. Antonelli, A revision-theoretic analysis of the arithmetical hierarchy, Notre Dame Journal of Formal Logic, vol. 35 (1994), pp. 204-208.
2. K. J. Barwise, Admissible sets and structures, Perspectives in Mathematical Logic, Springer Verlag, Berlin, Heidelberg, 1975.
3. J. P Burgess, The truth is never simple, this Journal, vol. 51 (1986), no. 3, pp. 663-681.
4. A. Chapuis, Alternate revision theories of truth, Journal of Philosophical Logic, vol. 25 (1996), pp. 399-423.
5. P Clote, A generalization of the limit lemma and clopen games, this Journal, vol. 51 (1986), no. 2, pp. 273-291.
6. K. Devlin, Constructibility, Perspectives in Mathematical Logic, Springer Verlag, Berlin, Heidelberg, 1984.
7. 2,-degrees, Fundamenta Mathematicae, vol. 81 (1974), pp. 183- 192.
8. R. O. Gandy, On a proof of Mostowski’s conjecture, Bulletin de l’Academie Polonaise des Sciences (serie des sciences mathematique, astronomique etphysique), vol. 8 (1960), pp. 571-575.
9. A. Gupta and N. Belnap, The revision theory of truth, MIT Press, Cambridge MA, 1993.
10. J. D. Hamkins and A. Lewis, Infinite time Turing machines, this Journal, vol. 65 (2000), no. 2, pp. 567-604.
11. H. G. Herzberger, Naive semantics and the Liar paradox, The Journal of Philosophy, vol. 79 (1982), pp. 479-497.
12. H. G. Herzberger, Notes on naive semantics, Journal of Philosophical Logic, vol. 11 (1982), pp. 61-102.
13. # and S* are not axiomatisable, Notre Dame Journal of Formal Logic, vol. 34 (1993), pp. 583-596.
14. S. Kripke, Outline of a theory of truth, The Journal of Philosophy, vol. 72 (1975), pp. 690-716.
15. B. Lowe, Revision sequences and computers with an infinite amount of time, Proceedings of XVIII Deutscher Kongrefi fur Philosophie der AGPD. Okt. 1999, reprinted in Journal of Logic and Computation, vol. 11 (2001), pp. 25-40.
16. B. Lowe and P. D. Welch, Set-theoretic absoluteness and the revision theory of truth, Studia Logica, vol. 68 (2001), no. 1, pp. 25-40.
17. Y Moschovakis, Elementary induction on abstract structures, Studies in Logic series, vol. 77, North-Holland, 1974.
18. Y Moschovakis, On non-monotone inductive definitions, Fundamenta Mathematicae, vol. 82 (1974), pp. 39-83.
19. H. Rogers, Recursive function theory, Series in Higher Mathematics, McGraw-Hill, 1967.
20. P. D. Welch, On an algorithmic theory of truth, in preparation.
21. P D. Welch, On Gupta-Belnap revision theories of truth, Kripkean fixed points, and the next stable set, The Bulletin of Symbolic Logic, vol. 7 (2001), no. 3, pp. 345-360.
22. A. Yaqüb, The liar speaks the truth. A defense of the revision theory of truth, Oxford University Press, New York, 1993.