Well-foundedness proof for first-order reflection
classification
🧮 math.LO
keywords
first-orderproofreflectioncomputablegivenotationnotesystem
read the original abstract
In this note we give a wellfoundedness proof of a computable notation system for first-order reflection.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.