Related papers: Valuations in G\"{o}del Logic, and the Euler Chara…

The Euler characteristic can be defined as a special kind of valuation on finite distributive lattices. This work begins with some brief consideration on the role of the Euler characteristic on NM algebras, the algebraic counterpart of…

Classically, two propositions are logically equivalent precisely when they are true under the same logical valuations. Also, two logical valuations are distinct if, and only if, there is a formula that is true according to one valuation,…

The $\mathbb{A}^1$-Euler characteristic is a refinement in algebraic geometry of the classical topological Euler characteristic, which can be constructed using motivic homotopy theory. This invariant is a quadratic form rather than an…

Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial…

The Euler characteristic of a finite category is defined and shown to be compatible with Euler characteristics of other types of object, including orbifolds. A formula for the cardinality of the colimit of a diagram of sets is proved,…

Finite Euler product is known to be one of the classical zeta functions in number theory. In [1], [2] and [3], we have introduced some multivariable zeta functions and studied their definable probability distributions on R^d. They include…

This note studies the behavior of Euler characteristics and of intersection homology Euler characterstics under proper morphisms of algebraic (or analytic) varieties. The methods also yield, for algebraic (or analytic) varieties, formulae…

Intuitionistic Propositional Logic is proved to be an infinitely many valued logic by Kurt G\"odel (1932), and it is proved by Stanis{\l}aw Ja\'skowski (1936) to be a countably many valued logic. In this paper, we provide alternative proofs…

The notion of the orbifold Euler characteristic came from physics at the end of 80's. There were defined higher order versions of the orbifold Euler characteristic and generalized ("motivic") versions of them. In a previous paper the…

This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…

This paper deals with the foundations of quantum mechanics. We start by outlining the characterisation, due to Birkhoff and Von Neumann, of the logical structures of the theories of classical physics and quantum mechanics, as boolean and…

We propose a definition of an Euler characteristic for unbounded chain complexes by taking the (usual) Euler characteristics of successively longer parts of the complex, weighted inversely proportional to the length, and passing to the…

If a real value invariant of compact combinatorial manifolds (with or without boundary) depends only on the number of simplices in each dimension on the manifold, then the invariant is completely determined by Euler characteristics of the…

We extend Auslander and Buchsbaum's Euler characteristic from the category of finitely generated modules of finite projective dimension to the category of modules of finite G-dimension using Avramov and Martsinkovsky's notion of relative…

There are (at least) two different approaches to define equivariant analogue of the Euler charateristic for a space with a finite group action. The first one defines it as an element of the Burnside ring of the group. The second approach…

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…

The Euler characteristic of a cell complex is often thought of as the alternating sum of the number of cells of each dimension. When the complex is infinite, the sum diverges. Nevertheless, it can sometimes be evaluated; in particular, this…

In this article, we study Euler characteristic techniques in topological data analysis. Pointwise computing the Euler characteristic of a family of simplicial complexes built from data gives rise to the so-called Euler characteristic…

It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of non-orthomodular and thus non-distributive lattices that properly contain standard orthomodular and Boolean classes,…