![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Model theoretic tools for deciding boundedness of fixed points
Model theoretic tools for deciding boundedness of fixed pointsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Matthew Parkinson. Boundedness concerns the question whether a given monotone/positive first-order inductive definition converges to its fixed point within a uniformly bounded number of steps. This is equivalent to the question whether the fixed point is itself first-order, by a classical theorem of Barwise and Moschovakis. The corresponding decision problem is undecidable for all but very limited fragments of first-order logic. I want to focus on the decidability frontier for monadic fixed points and to discuss some old and new results and techniques that suggest to look for a model theoretic divide between decidable and undecidable cases. This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsComputer Science Careers Events Asian Archaeology GroupOther talksAnthropology, mass graves and the politics of the dead Fundamental Limits to Volcanic Cooling and its Implications for Past Climate on Earth Political Thought, Time and History: An International Conference Advances in understanding and treatment of eating disorders What we don’t know about the Universe from the very small to the very big : ONE DAY MEETING |