Learn More
This article explores Herbrand’s theorem as the source of a natural notion of abstract proof object for classical logic, embodying the “essence” of a sequent calculus proof. We see how to view a calculus of abstract Herbrand proofs (Herbrand nets) as an analytic proof system with syntactic cut-elimination. Herbrand nets can also be seen as(More)
Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to proofs in the classical sequent calculus is thus an important step in understanding classical sequent calculus proofs.(More)
This paper is a brief intoduction to the αǫ-calculus – a calculus of communication and duplication inspired by the structure of the classical quantifiers. We will summarize the results of a paper in preparation on connections between extensions of the calculus, sequent sys-tems/proof nets for classical logic, and Herbrand's theorem.
PURPOSE To improve the efficiency of the labeling task in automatic quality control of MR spectroscopy imaging data. METHODS 28'432 short and long echo time (TE) spectra (1.5 tesla; point resolved spectroscopy (PRESS); repetition time (TR)= 1,500 ms) from 18 different brain tumor patients were labeled by two experts as either accept or reject, depending(More)
A formulation of naive set theory is given in Lafont's Soft Linear Logic, a logic with polynomial time cut-elimination. We demonstrate that the provably total functions of this set theory are precisely the PTIME functions. A novelty of this approach is the representation of the unary/binary natural numbers by two distinct sets (the safe naturals and the(More)