Beth definability and the Stone-Weierstrass Theorem
Luca Reggio

TL;DR
This paper links the classical Stone-Weierstrass Theorem to Beth definability in an equational logic framework, establishing a logical foundation for a fundamental theorem in functional analysis.
Contribution
It introduces an infinitary equational logic and shows the Stone-Weierstrass Theorem follows from Beth definability within this logical setting.
Findings
Established a logical interpretation of the Stone-Weierstrass Theorem.
Proved a strong completeness theorem for the associated propositional logic.
Connected functional analysis results with logical definability properties.
Abstract
The Stone-Weierstrass Theorem for compact Hausdorff spaces is a basic result of functional analysis with far-reaching consequences. We introduce an equational logic associated with an infinitary variety and show that the Stone-Weierstrass Theorem is a consequence of the Beth definability property of , stating that every implicit definition can be made explicit. Further, we define an infinitary propositional logic by means of a Hilbert-style calculus and prove a strong completeness result whereby the semantic notion of consequence associated with coincides with .
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.
