Pages that link to "Item:Q817706"
From MaRDI portal
The following pages link to The epsilon calculus and Herbrand complexity (Q817706):
Displaying 24 items.
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem (Q265002) (← links)
- Proof generalization in \(\mathrm {LK}\) by second order unifier minimization (Q331619) (← links)
- The epsilon-reconstruction of theories and scientific structuralism (Q334861) (← links)
- Completeness of indexed \(\varepsilon\)-calculus (Q1411658) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- A sequent-calculus based formulation of the extended first epsilon theorem (Q1709688) (← links)
- A mathematical basis for egress complexity (Q1921174) (← links)
- Herbrand's theorem as higher order recursion (Q1987218) (← links)
- Ackermann's substitution method (remixed) (Q2503393) (← links)
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Q3305635) (← links)
- Epsilon Calculi (Q3433105) (← links)
- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) (Q3540181) (← links)
- Non-elementary speed-ups in logic calculi (Q3545216) (← links)
- Complexity of Ehrenfeucht models (Q3546055) (← links)
- The Rank Function and Hilbert'S Second ε-Theorem (Q3809764) (← links)
- UNSOUND INFERENCES MAKE PROOFS SHORTER (Q4628675) (← links)
- A note on a proof of Hilbert's second <i>ε</i>-theorem (Q4724597) (← links)
- EPSILON THEOREMS IN INTERMEDIATE LOGICS (Q5082060) (← links)
- Semantics and Proof Theory of the Epsilon Calculus (Q5224489) (← links)
- Expansion trees with cut (Q5236547) (← links)
- Epsilon nets and union complexity (Q5370694) (← links)
- VON NEUMANN’S CONSISTENCY PROOF (Q5737949) (← links)
- Cut Elimination in ε‐Calculi (Q5896367) (← links)
- Herbrand complexity and the epsilon calculus with equality (Q6178471) (← links)
