Abstract
Hilbert’s ε-calculus [1,2] is based on an extension of the language of predicate logic by a term-forming operator ε x . This operator is governed by the critical axiom
A(t) →A(εx A(x)),
where t is an arbitrary term. Within the ε-calculus, quantifiers become definable by \(\exists x A(x) \Leftrightarrow A(\epsilon{x}{A(x)})\) and \(\forall xA(x) \Leftrightarrow A(\epsilon{x}{\lnot A(x)})\). (The expression εx A(x) is called an ε-term.)
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 subscriptionsReferences
Hilbert, D., Bernays, P.: Grundlagen der Mathematik, 2nd edn., vol. I,II. Springer, Heidelberg (1970)
Leisenring, A.C.: Mathematical Logic and Hilbert’s ε-symbol. MacDonald Technical and Scientific, London (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moser, G., Zach, R. (2003). The Epsilon Calculus. In: Baaz, M., Makowsky, J.A. (eds) Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol 2803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45220-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-45220-1_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40801-7
Online ISBN: 978-3-540-45220-1
eBook Packages: Springer Book Archive