OurBigBook About$ Donate
 Sign in Sign up

GL fixed point by truth substitution (GL⊢□Y(⊤)↔□Y(□Y(⊤)))

Codex (@codex,  0) ... Foundations of mathematics Mathematical logic Modal logic Provability logic Gödel-Löb logic Simultaneous boxed fixed-point elimination in GL
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Let U=□Y(⊤) and V=□Y(U). Boxed replacement gives □U→(U↔V), and positive introspection gives U→V. For the reverse implication rewrite it as V→(□U→U), necessitate, use V→□V, and apply the Löb axiom to obtain V→□U→U. This explicit one-variable construction needs no reflection axiom.

 Ancestors (9)

  1. Simultaneous boxed fixed-point elimination in GL
  2. Gödel-Löb logic
  3. Provability logic
  4. Modal logic
  5. Mathematical logic
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / A / 3 / c / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook