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 Godel 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 phi, and prove that they indeed provide information about the logical status of phi in Godel 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...
It must be admitted that mathematical investigations in providing alternative semantics have carried...
The Euler characteristic of a finite category is defined and shown to be compatible with Euler chara...
The aim of this paper is to show that a restriction of a logical language to clauses like Horn claus...
Using the lattice-theoretic version of the Euler characteristic in-troduced by V. Klee and G.-C. Rot...
Some decades ago, V. Klee and G.-C. Rota introduced a lattice-theoretic analogue of the Euler charac...
Using the lattice-theoretic version of the Euler characteristic introduced by V. Klee and G.-C. Rota...
The Euler characteristic can be defined as a special kind of valuation on finite distributive lattic...
We propose a new definition of the representation theorem for many-valued logics, with modal operato...
Classically, two propositions are logically equivalent precisely when they are true under the same l...
We introduce a framework for presenting non-classical logics in a modular and uniform way as labelle...
It is commonly assumed that Boolean logic is synonymous with two-valued logic. However, this needs n...
extended abstract Viorica Sofronie-Stokkermans1 Abstract. The main goal of this paper is to present ...
We present a general framework that allows to construct systematically analytic calculi for a large...
In the case of classical logic, the Stone isomorphism between Boolean Algebras and Boolean Rings is ...
We introduce a general recipe for presenting non-classical logics in a modular and uniform way as la...
It must be admitted that mathematical investigations in providing alternative semantics have carried...
The Euler characteristic of a finite category is defined and shown to be compatible with Euler chara...
The aim of this paper is to show that a restriction of a logical language to clauses like Horn claus...
Using the lattice-theoretic version of the Euler characteristic in-troduced by V. Klee and G.-C. Rot...
Some decades ago, V. Klee and G.-C. Rota introduced a lattice-theoretic analogue of the Euler charac...
Using the lattice-theoretic version of the Euler characteristic introduced by V. Klee and G.-C. Rota...
The Euler characteristic can be defined as a special kind of valuation on finite distributive lattic...
We propose a new definition of the representation theorem for many-valued logics, with modal operato...
Classically, two propositions are logically equivalent precisely when they are true under the same l...
We introduce a framework for presenting non-classical logics in a modular and uniform way as labelle...
It is commonly assumed that Boolean logic is synonymous with two-valued logic. However, this needs n...
extended abstract Viorica Sofronie-Stokkermans1 Abstract. The main goal of this paper is to present ...
We present a general framework that allows to construct systematically analytic calculi for a large...
In the case of classical logic, the Stone isomorphism between Boolean Algebras and Boolean Rings is ...
We introduce a general recipe for presenting non-classical logics in a modular and uniform way as la...
It must be admitted that mathematical investigations in providing alternative semantics have carried...
The Euler characteristic of a finite category is defined and shown to be compatible with Euler chara...
The aim of this paper is to show that a restriction of a logical language to clauses like Horn claus...