zbMATH — the first resource for mathematics

The lattice structure of some Lukasiewicz algebras. (English) Zbl 0495.03045

03G20 Logical aspects of Łukasiewicz and Post algebras
03B50 Many-valued logic
06D30 De Morgan algebras, Łukasiewicz algebras (lattice-theoretic aspects)
Full Text: DOI
[1] R. Balbes andP. Dwinger,Distributive lattices, University of Missouri Press, Columbia, Missouri 65201, 1974. · Zbl 0321.06012
[2] R. Cignoli,Boolean elements in Lukasiewicz algebras I, Proc. Japan Acad.,41 (1965), 670–675. · Zbl 0168.00601
[3] R. Cignoli andA. Monteiro,Boolean elements in Lukasiewicz algebras II, Proc. Japan Acad.,41 (1965), 676–680. · Zbl 0168.00602
[4] R. Cignoli,Moisil Algebras, Notas de Lógica Matemática, No. 27, Instituto de Matemática, Universidad Nac. del Sur. Bahía Blanca, Argentina, 1970.
[5] R. Cignoli,Injective De Morgan and Kleene algebras, Proc. Amer. Math. Soc.,47 (1975), 269–278.
[6] R. Cignoli The Lattice of global sections of sheaves of chains over Boolean spaces, Algebra Universalis,8 (1978) 357–373. · Zbl 0395.06006
[7] G. Epstein andA. Horn,P-Algebras, an abstraction from Post algebras, Algebra Universalis,4 (1974), 195–206. · Zbl 0294.06010
[8] G. Epstein andA. Horn,Logics which are characterized by subresiduated lattices, Z. Math. Logik Grundlagen Math.,22 (1976), 199–210. · Zbl 0347.02040
[9] R. Grigolia,Algebraic analysis of Lukasiewicz-Tarski’s n-valued logical systems. In: Selected Papers on Lukasiewicz Sentential Calculi (R. Wójcicki and G. Malinowski, Editors) Ossolineum, Wroclaw, Warszawa, 1977, 81–92.
[10] G. Moisil,Notes sur les logiques non-chryssippiennes, Ann. Sci. Univ. Jassy,27 (1941), 86–98.
[11] J. Varlet,Algebres de Lukasiewicz trivalentes, Bull. Soc. Roy. Sci. Liège,37 (1968), 399–408. · Zbl 0175.26604
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.