Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Beth definability and the Stone-Weierstrass Theorem (2007.05281v3)

Published 10 Jul 2020 in math.LO, math.FA, math.GN, and math.RA

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 $\vDash_{\Delta}$ associated with an infinitary variety $\Delta$ and show that the Stone-Weierstrass Theorem is a consequence of the Beth definability property of $\vDash_{\Delta}$, stating that every implicit definition can be made explicit. Further, we define an infinitary propositional logic $\vdash_{\Delta}$ by means of a Hilbert-style calculus and prove a strong completeness result whereby the semantic notion of consequence associated with $\vdash_{\Delta}$ coincides with $\vDash_{\Delta}$.

Summary

We haven't generated a summary for this paper yet.