Abstract
1.1 The relation α 1,.., α n ├α, or ├ α n α. As we have already explained in Chap. I, § 5, we want to lay the rules of down a calculus with the help of which we can obtain al-gorithmically all the consequences of arbitrary sets of expressions. Various different calculi of this sort are known today; every such calculus is called a predicate calculus or, more precisely, a first-order predicate calculus. (For predicate caluculus of higher order cf. Chap. VI, § 1.) In the next section, we shall give a particularly simple calculus of this sort. For the sake of simplicity, we shall call this calculus the predicate calculus (instead of a, predicate calculus).
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
Rights and permissions
Copyright information
© 1973 Springer-Verlag, Berlin/Heidelberg
About this chapter
Cite this chapter
Hermes, H. (1973). A Predicate Calculus. In: Introduction to Mathematical Logic. Universitext. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87132-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-87132-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05819-9
Online ISBN: 978-3-642-87132-0
eBook Packages: Springer Book Archive