Skip Navigation

Journal of Logic and Computation 2001 11(1):25-40; doi:10.1093/logcom/11.1.25
© 2001 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Löwe, B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Revision Sequences and Computers with an Infinite Amount of Time

Benedikt Löwe1

1 Rheinische Friedrich–Wilhelms–Universität Bonn, Mathematisches Institut, Beringstraße 6, D — 53115 Bonn, Germany. E-mail: loewe{at}math.uni-bonn.de

The author establishes a connection between Revision Theory of Truth and Infinite Time Turing Machines as developed by Hamkins and Kidder.

The ideas from this paper have incited Welch to solve the limit rule problem of revision theory.

Keywords: Revision theory of truth; infinite time Turing machines; definability

Accepted June 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.