Plain semi-post algebras as a poset-based generalization of post algebras and their representability

Studia Logica 48 (4):509 - 530 (1989)
  Copy   BIBTEX


Semi-Post algebras of any type T being a poset have been introduced and investigated in [CR87a], [CR87b]. Plain Semi-Post algebras are in this paper singled out among semi-Post algebras because of their simplicity, greatest similarity with Post algebras as well as their importance in logics for approximation reasoning ([Ra87a], [Ra87b], [RaEp87]). They are pseudo-Boolean algebras generated in a sense by corresponding Boolean algebras and a poset T. Every element has a unique descending representation by means of elements in a corresponding Boolean algebra and primitive Post constants which form a poset T. An axiomatization and another characterization, subalgebras, homomorphisms, congruences determined by special filters and a representability theory of these algebras, connected with that for Boolean algebras, are the subject of this paper.



    Upload a copy of this work     Papers currently archived: 92,197

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

46 (#347,350)

6 months
5 (#647,370)

Historical graph of downloads
How can I increase my downloads?