I may be misinterpreting the question, but the Lobstacle doesn’t apply to an agent using PA+N+1 building an agent that will use PA+N, and you can’t make the procrastination paradox with that finite descending chain of formal systems. Is that what you meant?
I may be misinterpreting the question, but the Lobstacle doesn’t apply to an agent using PA+N+1 building an agent that will use PA+N, and you can’t make the procrastination paradox with that finite descending chain of formal systems. Is that what you meant?