Well-foundedness proof for first-order reflection
Toshiyasu Arai
TL;DR
This paper provides a rigorous proof of well-foundedness for a computable notation system designed to represent first-order reflection principles.
Contribution
It introduces a well-foundedness proof specifically for a computable notation system related to first-order reflection, advancing formal understanding.
Findings
Establishes the well-foundedness of the notation system
Provides a formal proof framework for first-order reflection
Enhances the theoretical foundation of reflection principles
Abstract
In this note we give a wellfoundedness proof of a computable notation system for first-order reflection.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Logic, programming, and type systems · Cellular Automata and Applications