On an Algebra of Lattice-Valued Logic

Journal of Symbolic Logic 70 (1):282 - 318 (2005)

Authors
Abstract
The purpose of this paper is to present an algebraic generalization of the traditional two-valued logic. This involves introducing a theory of automorphism algebras, which is an algebraic theory of many-valued logic having a complete lattice as the set of truth values. Two generalizations of the two-valued case will be considered, viz., the finite chain and the Boolean lattice. In the case of the Boolean lattice, on choosing a designated lattice value, this algebra has binary retracts that have the usual axiomatic theory of the propositional calculus as suitable theory. This suitability applies to the Boolean algebra of formalized token models [2] where the truth values are, for example, vocabularies. Finally, as the actual motivation for this paper, we indicate how the theory of formalized token models [2] is an example of a many-valued predicate calculus
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1107298521
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 45,328
Through your library

References found in this work BETA

Introduction to Mathematical Logic.Elliott Mendelson - 1964 - Journal of Symbolic Logic 54 (2):618-619.
Many-Valued Logics.J. B. Rosser & A. R. Turquette - 1954 - British Journal for the Philosophy of Science 5 (17):80-83.
Lattice Theory.Garrett Birkhoff - 1940 - Journal of Symbolic Logic 5 (4):155-157.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2010-08-24

Total views
23 ( #394,684 of 2,280,318 )

Recent downloads (6 months)
11 ( #75,480 of 2,280,318 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature