Abstract
Recall from Chapter 1 that the basic property of “normal” preferential structures is that minimization is upward absolute. If \(\mathit{x, y} \in \mathit{X,\, x} \prec \mathit{y},\,\, \mathrm{i.e.,} \,\, \mathit{y} \) is a non-minimal element in X, and \(\mathit{X} \subseteq \mathit{Y}\) then y will be a non-minimal element in Y, too - as \(\mathit{x} \in \mathit{Y}\) This results in the fundamental “algebraic” property that for \(\mathit{X} \subseteq \mathit{Y} \,\,\mu (\mathit{Y}) \cap \mathit{X} \subseteq \mu (\mathit{X}), \mathrm{where} \,\,\mu (\mathit{X})\) is the set of minimal elements of X.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Schlechta, K. (2018). Higher Preferential Structures. In: Formal Methods for Nonmonotonic and Related Logics. Springer, Cham. https://doi.org/10.1007/978-3-319-89653-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-89653-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89652-6
Online ISBN: 978-3-319-89653-3
eBook Packages: Computer ScienceComputer Science (R0)