Hilbert's epsilon as an Operator of Indefinite Committed Choice
Author:
- Claus-Peter WirthCWClaus-Peter Wirth
Preprint
Abstract
Paul Bernays and David Hilbert carefully avoided overspecification of Hilbert's epsilon-operator and axiomatized only what was relevant for their proof-theoretic investigations. Semantically, this left the epsilon-operator underspecified. In the meanwhile, there have been several suggestions for semantics of the epsilon as a choice operator. After reviewing the literature on semantics of Hilbert's epsilon operator, we propose a new semantics with the following features: We avoid overspecification (such as right-uniqueness), but admit indefinite choice, committed choice, and classical logics. Moreover, our semantics for the epsilon supports proof search optimally and is natural in the sense that it does not only mirror some cases of referential interpretation of indefinite articles in natural language, but may also contribute to philosophy of language. Finally, we ask the question whether our epsilon within our free-variable framework can serve as a paradigm useful in the specification and computation of semantics of discourses in natural language.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- , , and Non-Permutability of -StepsJournal of Symbolic Computation, 2012
- Shallow confluence of conditional term rewriting systemsJournal of Symbolic Computation, 2009
- An Even Closer Integration of Linear Arithmetic into Inductive Theorem ProvingElectronic Notes in Theoretical Computer Science, 2006
- A New Indefinite Semantics for Hilbert’s EpsilonLecture Notes in Computer Science, 2002
- An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof2002
- Hilbert’s ∈-Terms in Automated Theorem ProvingLecture Notes in Computer Science, 1999
- Consequences of the Axiom of Choice1998
- Anaphoric pronouns in very late medieval supposition theoryLinguistics and Philosophy, 1994
- Hilbert's ϵ‐operator in intuitionistic type theoriesMathematical Logic Quarterly, 1993
- Unification under a mixed prefixJournal of Symbolic Computation, 1992