Fixed Point Theorem for G

The Fixed Point Theorem for G

Part III Seminar Talk, 13 March 2008, 2.55-3.50pm, CMS Meeting Room 9.

The modal logic G is the 'logic of provability': the box operator is interpreted to mean 'it is provable'.

One of the nicest basic properties of G is the vast amount of fixed points. In my talk, I will give an outline of a proof of the Fixed Point Theorem for G.

This proof is not the shortest, but it is in my opinion the most conceptually clear proof: it uses the machinery of Beth definability and admits a completely semantical approach.

Last modified: 9 March, 2008.