Abstract
This paper presents a monotonic system of Post algebras of order ω+ω* whose chain of Post constans is isomorphic with 0≤1≤2≤ ... ≤-3≤-2≤-1. Besides monotonic operations, other unary operations are considered; namely, disjoint operations, the quasi-complement, succesor, and predecessor operations. The successor and predecessor operations are basic for number theory.
Similar content being viewed by others
References
Białynicki-Birula, A. andH. Rasiowa, 1957, ‘On the representation of quasi-Boolean algebras’,Bull. Ac. Pol. Sc. C1.III, 5, 615–617.
Ng. Cat Ho, 1973, ‘Generalized Post algebras and their applications to some infinitary many-valued logics.’,Dissertationes Mathematicae CVII, 1–76.
Ng. Cat Ho, andH. Rasiowa, 1987, ‘Semi-Post algebras’,Studia Logica, 46 (2), 147–158.
Ng. Cat Ho, andH. Rasiowa, 1989, ‘Plain semi-Post algebras as a posets-based generalization of Post algebras and their representability’,Studia Logica, 48 (4), 509–530.
Dwinger, Ph., 1966, ‘Notes on Post algebras I, II’,Indag. Math., 28, 462–478.
Epstein G., andA. Horn, 1974, ‘P-algebras, An abstraction from Post algebras’,Algebra Universalis, 4, 195–206.
Epstein G., 1960, ‘The lattice theory of Post algebras’,Trans. Amer. Math. Soc., 95, 300–317.
Epstein G., andH. Rasiowa, 1986, ‘A P-algebraic extension of Post algebras of order ω+' Proc. ISMVL '86, Blacksburg, VA, 27–29 May 1986,IEEE Computer Society Press, 4–7.
Epstein G., andH. Rasiowa, 1990, ‘Theory and uses of Post algebras of order ω+ω*, I’. Proc. 20th International Symposium on Multiple-Valued Logic ISMVL '90, Charlotte, NC, 23–25 May 1990,IEEE Computer Science Press, 42–47.
Epstein G., andH. Rasiowa, 1991, ‘Theory and uses of Post algebras of order ω+ω*, Part II’, Proc. 21st Int'l Symp. on Multiple-Valued Logic ISMVL '91, Victoria B. C., 26–29 May 1991,IEEE Computer Science Press, 248–254.
Rasiowa H., 1973, ‘On generalized Post algebras of order ω and ω+-valued predicate calculi’,Bull. Ac. Pol. Sci. Ser. Math. Astron. Phys., 21, 209–219.
Rasiowa H., 1974, ‘An algebraic approach to non-classical logics’,Studies in Logic and the Foundations of Mathematics,Vol. 78, North Holland, London-New York.
Rasiowa H., 1986, ‘Rough concepts and multiple-valued logic’, Proc. ISMVL '86, Blacksburg, VA, 27–29 May 1986,IEEE Computer Society Press, 282–288.
Rasiowa H., 1988, ‘Logic of approximation reasoning’, Proc. 1st Workshop on Computer Science Logic, CSL '87, Karlsruhe, FRG, October 1987,E. Borger, H. Kleine Buning, M. M. Riichter, Lecture Notes in Computer Science 329, Springer, 188–210.
Rasiowa H., 1989, ‘Logics of approximation reasoning semantically based on partially ordered sets’, Notes of invited lecture, ASL Logic Colloquium '89, Berlin, FRG.
Rasiowa H., andG. Epstein, 1987, ‘Approximation reasoning and Scott's information systems.’ Proc. 2nd International Symposium on Methodologies for Intelligent Systems,North Holland, 33–42.
Rousseau G., 1970, ‘Post algebras and pseudo-Post algebras’,Fund. Math. 67, 133–145.
Rasiowa H., andR. Sikorski, 1950, ‘A proof of the completeness theorem of Godel’,Fund. Math., 37, 193–200.
Rasiowa H., andR. Sikorski, 1970, ‘The Mathematics of Metamathematics’,Pol. Sci. Publ., 3rd ed.
Traczyk T., 1967, ‘On Post algebras with uncountable chain of constants. Algebras and homomorphisms’,Bull. Ac. Pol. Sci., Ser. Math. Astron. Phys., 15, 673–680.
Author information
Authors and Affiliations
Additional information
The editing of this unified version of two previous papers [Epstein, Rasiowa 1990, 1991] by the authors was completed, except for footnotes, while the first author visited at Warsaw University during June–July, 1994. The footnotes were added by the first author in September, 1994.
Rights and permissions
About this article
Cite this article
Epstein, G., Rasiowa, H. A partially ordered extention of the integers. Stud Logica 54, 303–332 (1995). https://doi.org/10.1007/BF01053003
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01053003