On a strengthening of Kotlarski's theorem
Evgeny Dashkov

TL;DR
This paper presents a strengthened version of Kotlarski's theorem, enhancing its formalization within the framework of weak König's lemma (WKL_0).
Contribution
It introduces a novel strengthening of Kotlarski's theorem and formalizes it within WKL_0, expanding its applicability in mathematical logic.
Findings
Enhanced formalization of Kotlarski's theorem within WKL_0
New proof techniques for bounded induction and satisfaction classes
Potential implications for foundational studies in logic
Abstract
Kotlarski's theorem (see H. Kotlarski. Bounded Induction and Satisfaction Classes. Mathematical Logic Quarterly, vol. 32, 31-34, 1986, P. 531--544.) formalized in .
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
TopicsAdvanced Algebra and Logic · Logic, Reasoning, and Knowledge · Computability, Logic, AI Algorithms
