Valuations in G\"odel Logic, and the Euler Characteristic
Abstract
Using the lattice-theoretic version of the Euler characteristic introduced by V. Klee and G.-C. Rota in the Sixties, we define the Euler characteristic of a formula in G\"odel logic (over finitely or infinitely many truth-values). We then prove that the information encoded by the Euler characteristic is classical, i.e. coincides with the analogous notion defined over Boolean logic. Building on this, we define many-valued versions of the Euler characteristic of a formula , and prove that they indeed provide information about the logical status of in G\"odel logic. Specifically, our first main result shows that the many-valued Euler characteristics are invariants that separate many-valued tautologies from non-tautologies. Further, we offer an initial investigation of the linear structure of these generalised characteristics. Our second main result is that the collection of many-valued characteristics forms a linearly independent set in the real vector space of all valuations of G\"odel logic over finitely many propositional variables.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.