Interesting! Can you make a specific model of a 5-and-10 failure in minimal logic, using something similar to the “malicious proof search ordering” 5-and-10 failure in classical logic?
Thanks for the suggestion, Patrick. I’ve now adapted Tsvi’s formal argument to the reframed “5-equals-10 problem” and added it into the last section of my writeup.
Interesting! Can you make a specific model of a 5-and-10 failure in minimal logic, using something similar to the “malicious proof search ordering” 5-and-10 failure in classical logic?
Thanks for the suggestion, Patrick. I’ve now adapted Tsvi’s formal argument to the reframed “5-equals-10 problem” and added it into the last section of my writeup.