Abstract
Propositional logic allows only for the description of extremely simple language constructions: boolean operations with propositions. It is not powerful enough for representing many constructions used in computer science, linguistics, mathematics or for formalizing significant fragments of reasoning in action, as for example:
-
• certain students attend all courses;
-
• no student attends an uninteresting course;
-
• can we conclude that all courses are interesting?
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
© 2004 Springer-Verlag London
About this chapter
Cite this chapter
Lassaigne, R., de Rougemont, M. (2004). First-order logic. In: Logic and Complexity. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-392-3_4
Download citation
DOI: https://doi.org/10.1007/978-0-85729-392-3_4
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1052-1
Online ISBN: 978-0-85729-392-3
eBook Packages: Springer Book Archive