University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Model theoretic tools for deciding boundedness of fixed points

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Model theoretic tools for deciding boundedness of fixed points

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 lists

Alison Richard Building Room 119 Lucy Cavendish College LT2, The Computer Lab, William Gates Building, 15 JJ Thomson Ave, Cambridge, CB3 0FD and zoom

Other talks

Loke CTR Annual Meeting 2026 - Epigenetics of embryogenesis and placentation LMB Seminar - Mechanisms of mRNA packaging and export Wolfson Tool Factory There is no such thing as weather: a historical and cultural geography of weather (and health) Early cancer clinical trials Carrollian momenta from anti de Sitter
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity