Some Results on Computing Function Values in Finite Post Algebras,

Abstract

Several results on Post lattices are presented which generalize theorems found by Epstein, and characterizations are given, in the case where the lattice is finite, for two sequences occuring in his definition of Post algebra. These characteristics yield a striking simplification in the computational complexity of an example given by Wojcik. (Author)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1971
Accession Number
AD0737044

Entities

People

  • Ed Ducasse
  • Gernot Metze

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Computational Complexity
  • Mathematics
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Strategic Security Studies