English
Related papers

Related papers: The Epsilon Calculus and Herbrand Complexity

200 papers

The problem of giving a computational meaning to classical reasoning lies at the heart of logic. This article surveys three famous solutions to this problem - the epsilon calculus, modified realizability and the dialectica interpretation -…

Logic in Computer Science · Computer Science 2018-12-17 Thomas Powell

This paper presents a sound and completecalculus for causal relevance, based onPearl's functional models semantics.The calculus consists of axioms and rulesof inference for reasoning about causalrelevance relationships.We extend the set of…

Artificial Intelligence · Computer Science 2013-01-14 Blai Bonet

We show how Leibnitz.s indiscernibility principle and Gentzen's original work lead to extensions of the sequent calculus to first order logic with equality and investigate the cut elimination property. Furthermore we discuss and improve the…

Logic · Mathematics 2017-05-03 Franco Parlamento , Flavio Previale

The usual $\epsilon,\delta$-definition of the limit of a function (whether presented at a rigorous or an intuitive level) requires a "candidate $L$" for the limit value. Thus, we have to start our first calculus course with "guessing"…

Logic · Mathematics 2011-08-24 Todor D. Todorov

Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…

Logic · Mathematics 2024-10-08 Sayantan Roy

Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…

Formal Languages and Automata Theory · Computer Science 2017-01-11 Thomas Place , Marc Zeitoun

A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The…

Commutative Algebra · Mathematics 2024-12-05 Fulvio Gesmundo , Leonie Kayser , Simon Telen

The present report, has been inspired by the need of the author and its colleagues to understand the underlying theory of Wirtinger's Calculus and to further extend it to include the kernel case. The aim of the present manuscript is…

Machine Learning · Computer Science 2010-06-02 P. Bouboulis

We explain why and how the Hilbert space comes about in quantum theory. The axiomatic structures of vector space, of scalar product, of orthogonality, and of the linear functional are derivable from the statistical description of quantum…

Quantum Physics · Physics 2023-03-13 Yu. V. Brezhnev

One of the benefit properties implied by the extensionality axiom of Hilbert's epsilon calculus is that the calculus becomes complete with respect to the choice structures as semantics. Another implication of the axiom, discussed in the…

Logic · Mathematics 2011-07-14 Zoltan Molnar

This paper introduces two sequent calculi for intuitionistic strong L\"ob logic ${\sf iSL}_\Box$: a terminating sequent calculus ${\sf G4iSL}_\Box$ based on the terminating sequent calculus ${\sf G4ip}$ for intuitionistic propositional…

Logic · Mathematics 2023-03-07 Iris van der Giessen , Rosalie Iemhoff

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…

Logic in Computer Science · Computer Science 2013-02-05 Giorgi Japaridze

Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit…

Logic in Computer Science · Computer Science 2018-10-18 Gabriel Ebner

I formalize important theorems about classical propositional logic in the proof assistant Coq. The main theorems I prove are (1) the soundness and completeness of natural deduction calculus, (2) the equivalence between natural deduction…

Logic · Mathematics 2015-04-01 Floris van Doorn

Second-order two-scale expansions, a unified proof for the regularity of the correctors based on the translation invariant and a lemma for extracting $O(\epsilon)$ from the remainder term are presented for the second order nonlinear…

Mathematical Physics · Physics 2011-09-07 Zhang QiaoFu , Cui JunZhi

This paper positively solves an open problem if it is possible to provide a Hilbert system to Epistemic Logic of Friendship (EFL) by Seligman, Girard and Liu. To find a Hilbert system, we first introduce a sound, complete and cut-free tree…

Logic in Computer Science · Computer Science 2019-07-11 Katsuhiko Sano

We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-deterministic tree grammar of order 2 which generates a finite…

Logic in Computer Science · Computer Science 2016-06-22 Bahareh Afshari , Stefan Hetzl , Graham E. Leigh

Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…

Category Theory · Mathematics 2015-07-22 Martin Hyland

The one-sided and full Hilbert transforms are evaluated exactly by means of the method of finite-part integration [E.A. Galapon, \textit{Proc. Roy. Soc. A} \textbf{473}, 20160567 (2017)]. In general, the result consists of two terms -- the…

Complex Variables · Mathematics 2023-09-01 Philip Jordan D. Blancas , Eric A. Galapon

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2010-10-01 Alwen Tiu , Alberto Momigliano