Abstract
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.
Similar content being viewed by others
References
Ng. Cat Ho, Generalized Post algebras and their applications to some infinitary many-valued logics, Dissertations Mathematicae CVII (1973), pp. 1–76.
Ng. Cat Ho and H. Rasiowa, Semi-Post-algebras, Studia Logica 46, 2 (1987), pp. 147–158.
Ng. Cat Ho and H. Rasiowa, Subalgebras and homomorphisms of semi-Post algebras, ibidem 46, 2 (1987), pp. 159–173.
Ph. Dwinger, Notes on Post algebras I, II, Indagationes Math. 28 (1966), pp. 462–478.
Ph. Dwinger, Generalized Post algebras, Bull. Ac. Polon. Sci. Sér. Math. Astronom. Phys. 16 (1968), pp. 559–563.
Ph. Dwinger, Ideals in generalized Post algebras, ibidem, 17 (1969), pp. 483–486.
G. Epstein, The lattice theory of Post algebras, Trans. Amer. Math. Soc. 95 (1960), pp. 300–317.
H. Rasiowa, On generalized Post algebras of order ω + and ω + -valued predicate calculi, Bull. Ac. Polon. Sci. Sér. Math. Astr. Phys. 21 (1973), pp. 209–219.
H. Rasiowa, An Algebraic Approach to Non-Classical Logics, North-Holland, London-New York, 1974.
H. Rasiowa, Many-valued algorithmic logic as a tool to investigate programs, in: Modern Uses of Multiple-Valued Logic, ed. by G. Epstein, Reidel (1977), pp. 77–102.
H. Rasiowa, Topological representations of Post algebras of order ω + and open theories based on ω + -valued logic, Studia Logica 44, 4 (1985), pp. 353–368.
H. Rasiowa, Rough concepts and multiple-valued logic, Proc. of ISMVL'86, May 27–29,1986, Blacksburg, Virginia, USA, Computer Society Press, 1986, pp. 282–288.
H. Rasiowa, An algebraic approach to some approximate reasoning, Proc. of ISMVL'87, Boston, USA, May 26–28, 1987, Computer Society Press, 1987, pp. 342–347.
H. Rasiowa, Logic of approximation reasoning, Proceedings, 1st Workshop on Computer Science Logic (CSL'87), Karlsruhe, Oct. 12–16, 1987, eds. E. Börger, H. Kleine Büning, M. M. Richter, LNCS 329 (1988), pp. 188–210.
H. Rasiowa, and G. Epstein, Approximation reasoning and Scott's Information Systems, Proc. Int. Symp. Methodologies for Intelligent Systems, Charlotte 14–17 October, 1987, USA, North-Holland, pp. 33–42.
H. Rasiowa and R. Sikorski, A proof of the completeness theorem of Gödel, Fund. Math. 37 (1950), pp. 193–200.
H. Rasiowa and R. Sikorski, The Mathematics of Metamathematics, 3rd ed. 1970.
G. Rousseau, Post algebras and pseudo-Post algebras, Fund. Math. 67 (1970), pp. 133–145.
R. Sikorski, Boolean Algebras, third ed., Berlin-Göttingen-Heidelberg-New York, 1969.
T. Traczyk, On Post algebras with uncountable chain of constants. Algebras and Homomorphisms, Bull. Ac. Polon. Sci. Sér. Math. Astr. Phys. 15 (1967), pp. 673–680.
T. Traczyk, Prime ideals in generalized Post algebras, ibidem 16 (1968), pp. 369–373.
Author information
Authors and Affiliations
Additional information
To the memory of Jerzy Słupecki
Research reported here has been supported by Polish Government Grant CPBP 01.01
Rights and permissions
About this article
Cite this article
Ho, N.C., Rasiowa, H. Plain Semi-Post algebras as a poset-based generalization of post algebras and their representability. Studia Logica 48, 509–530 (1989). https://doi.org/10.1007/BF00370204
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370204