Abstract
Observational predicate calculi are defined and deeply studied in [18]. These can be seen as a modification of classical predicate calculi – only finite models are allowed and generalized quantifiers are added to classical quantifiers ∀ and ∃. Finite models correspond to analysed data and generalized quantifiers make it possible to express various assertion on the analysed data. All 4ft-quantifiers defined and studied in this book are generalized quantifiers.
This is a preview of subscription content, log in via an institution to check access.
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
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rauch, J. (2013). Definability of Association Rules in Classical Predicate Calculi. In: Observational Calculi and Association Rules. Studies in Computational Intelligence, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11737-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-11737-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11736-7
Online ISBN: 978-3-642-11737-4
eBook Packages: EngineeringEngineering (R0)