Abstract
Plain predicate logic is called “first-order logic”, as it allows us to handle objects of structure, and to quantify over them. One might just as well allow quantification over subsets of structures. In that case we speak of a “second-order logic”, which is a logic with two kinds of quantifiers: ∀x and ∀X. The accompanying second-order structure has a domain of elements and one of subsets, which does not necessarily comprise all subsets. For these generalized structures a completeness theorem is proved, which fails for full structures, where quantifiers range over all subsets. The success of treating second-order logic is based on treating the second-order structures as somewhat dressed up first-order structures (there are two kinds of elements, ordinary ones and others that we call “sets”).
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 subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
van Dalen, D. (2013). Second-Order Logic. In: Logic and Structure. Universitext. Springer, London. https://doi.org/10.1007/978-1-4471-4558-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4558-5_5
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4557-8
Online ISBN: 978-1-4471-4558-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)