17 June 2002, ILLC talks, Benedikt Loewe

Abstract:

In several areas of mathematical logic, research has been directed to iterative constructions that will run into transfinite processes. Apart from the classical inductive definitions using monotone operators, nonmonotonic procedures have become prominent in several areas of applications.

In this talk, we shall be looking at two examples: Revision Sequences in the sense of Gupta and Belnap and Infinite Time Turing Machines as defined by Hamkins and Kidder and investigated by Hamkins, Lewis and Welch. The talk will survey complexity results in the different areas and discuss modifications and other areas of application of transfinite revision processes.