Abstract
Let S be a set. A partial ordering of S is a relation x ≤ y on elements of S such that x ≤ x, if x ≤ y and y ≤ z, then x ≤ z, and if x ≤ y and y ≤ x then x = y. We sometimes write y ≥ x for x ≤ y.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden
About this chapter
Cite this chapter
Kempf, G.R. (1995). Logic. In: Algebraic Structures. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-80278-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-322-80278-1_19
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-528-06583-6
Online ISBN: 978-3-322-80278-1
eBook Packages: Springer Book Archive