Translator Disclaimer
March 2005 On an algebra of lattice-valued logic
Lars Hansen
J. Symbolic Logic 70(1): 282-318 (March 2005). DOI: 10.2178/jsl/1107298521

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.

Citation

Download Citation

Lars Hansen. "On an algebra of lattice-valued logic." J. Symbolic Logic 70 (1) 282 - 318, March 2005. https://doi.org/10.2178/jsl/1107298521

Information

Published: March 2005
First available in Project Euclid: 1 February 2005

zbMATH: 1100.03053
MathSciNet: MR2119134
Digital Object Identifier: 10.2178/jsl/1107298521

Rights: Copyright © 2005 Association for Symbolic Logic

JOURNAL ARTICLE
37 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.70 • No. 1 • March 2005
Back to Top