A lambda calculus for Gödel-Dummett logic capturing waitfreedom

DOI10.1007/978-3-642-29822-6_14MaRDI QIDQ2900262zbMATH OpenOpenAlexWikidataFDO

Authors Yoichi Hirai

Publication date 20 July 2012

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29822-6_14

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Gödel logic. From natural deduction to parallel computation
• A deterministic terminating sequent calculus for Godel-Dummett logic
• Computer Science Logic
• Non deterministic classical logic: the $\lambda\mu^{++}$-calculus
• On natural deduction for Herbrand constructive logics. I: Curry-Howard correspondence for Dummett's logic \(\mathsf {LC}\)

Cited in

(3)

• On the concurrent computational content of intermediate logics
• Gödel logic. From natural deduction to parallel computation
• On natural deduction for Herbrand constructive logics. I: Curry-Howard correspondence for Dummett's logic \(\mathsf {LC}\)

This page was built for publication: A lambda calculus for Gödel-Dummett logic capturing waitfreedom

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900262)