QUASI Transitive Algebras,

Abstract

Quasitransitive algebras are (extensions of) both Kleene and Stone algebras supplied with: two additional, binary, operations: an equivalential operation, and the 'overmeet', (carrot) -which differs from ordinary meet in lacking idempotence, and in the join's not being distributive into it-; and with an additional unary operation, n, which carries every entity into its lower threshold. The filter of dense elements is considered the truth filter, in virtue of the endorsement principle: what is, to some extent or other however small, true is true. The fuzzy sentential calculus Ap corresponding to those algebras is shown to be both sound and complete.

Document Details

Document Type
Technical Report
Publication Date
May 01, 1983
Accession Number
ADP002343

Entities

People

  • L. Pena

Tags

DTIC Thesaurus Topics

  • Calculus

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Artificial Intelligence
  • Mathematical Modeling and Probability Theory.