Semantics and Proof Theory of the Epsilon Calculus
From MaRDI portal
Publication:5224489
DOI10.1007/978-3-662-54069-5_4zbMath1432.03114arXiv1610.06289OpenAlexW2533162327MaRDI QIDQ5224489
Publication date: 24 July 2019
Published in: Logic and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.06289
Related Items (3)
EPSILON THEOREMS IN INTERMEDIATE LOGICS ⋮ Herbrand complexity and the epsilon calculus with equality ⋮ Grounding, quantifiers, and paradoxes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Choice functions and the anaphoric semantics of definite NPs
- The predicate calculus with \(\varepsilon\)-symbol
- The epsilon calculus and Herbrand complexity
- Hilbert's \(\varepsilon{}\)-operator and classical logic
- Heyting predicate calculus with epsilon symbol
- Non-determinism in logic-based languages
- Completeness of indexed \(\varepsilon\)-calculus
- Epsilon-logic is more expressive than first-order logic over finite structures
- Theorie der Logischen Auswahlfunktionen
- Cut Elimination in a Gentzen-Style ε-Calculus Without Identity
- The Logic of Choice
- Intuitionistic ϵ‐ and τ‐calculi
- Foundations of Software Science and Computation Structures
- Cut Elimination in ε‐Calculi
This page was built for publication: Semantics and Proof Theory of the Epsilon Calculus