Gödel logic: From natural deduction to parallel computation

  title={G{\"o}del logic: From natural deduction to parallel computation},
  author={Federico Aschieri and Agata Ciabattoni and Francesco A. Genco},
  journal={2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
Propositional Gödel logic G extends intuitionistic logic with the non-constructive principle of linearity (A → B) ∨ (B → A). We introduce a Curry-Howard correspondence for G and show that a simple natural deduction calculus can be used as a typing system. The resulting functional language extends the simply typed λ-calculus via a synchronous communication mechanism between parallel processes, which increases its expressive power. The normalization proof employs original termination arguments… Expand
A Natural Deduction Calculus for Gödel-Dummett Logic Internalizing Proof-search Control Mechanisms
This paper introduces a natural deduction calculus for the GödelDummett Logic LC semantically characterized by linearly ordered Kripke models and sketches its soundness and completeness. Expand
Disjunctive Axioms and Concurrent λ-Calculi: a Curry-Howard Approach
This work adds to intuitionistic logic infinitely many classical disjunctive tautologies and uses the Curry--Howard correspondence to obtain typed concurrent $\lambda$-calculi, providing a first concurrent computational interpretation for many propositional intermediate logics, classical logic included. Expand
Intermediate Logics: From Hypersequents to Concurrent Computation
This work uses the CurryHoward correspondence to obtain new typed concurrent λ-calculi, each of which features a specific communication mechanism and implements techniques for handling and transmitting process closures. Expand
Intermediate Logic Proofs as Concurrent Programs
Building on ideas of Haskell Curry, in 1969 William Howard showed that constructing an intuitionistic proof is not at all different from writing a program in λ-calculus [8]. He also showed that theExpand
Par means parallel: multiplicative linear logic proofs as concurrent functional programs
It is proved that λpar satisfies all the desirable properties for a typed programming language: subject reduction, progress, strong normalization and confluence. Expand
A typed parallel λ-calculus via 1-depth intermediate proofs∗
We introduce a Curry–Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologiesExpand
A typed parallel lambda-calculus via 1-depth intermediate proofs
The resulting calculus, called $\lambda_{\parallel}$, is a strongly normalizing parallel extension of the simply typed $\lambda$-calculus that can model arbitrary process network topologies, and encode interesting parallel programs ranging from numeric computation to algorithms on graphs. Expand
On the concurrent computational content of intermediate logics
A proofs-as-concurrent-programs interpretation for a large class of intermediate logics that can be formalized by cut-free hypersequent calculi confirms Avron's 1991 thesis that intermediate logICS formalizable by hypersequent calculator can serve as basis for concurrent λ-calculi. Expand
Classical Proofs as Parallel Programs
A parallel and more powerful extension of the simply typed lambda calculus corresponding to an analytic natural deduction based on the excluded middle law is defined, which features a natural higher-order communication mechanism between processes, which also supports broadcasting. Expand
$\unicode{8523}$ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs
Along the lines of the Abramsky ``Proofs-as-Processes'' program, we present an interpretation of multiplicative linear logic as typing system for concurrent functional programming. In particular, weExpand


On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
It is proved that the typed calculus is strongly normalizing and it is shown that proof terms for simply existential statements reduce to a list of individual terms forming an Herbrand disjunction. Expand
On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC
This work adds to the lambda calculus an operator which represents, from the viewpoint of programming, a mechanism for representing parallel computations and communication between them, and from the point of view logic, Dummett's axiom. Expand
Proof analysis in intermediate logics
Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is presented, together with an easy cut-admissibility proof; both extend to cover, in a uniform fashion,Expand
Proofs and types
Sense, denotation and semantics natural deduction the Curry-Howard isomorphism the normalisation theorem Godel's system T coherence spaces denotational semantics of T sums in natural deduction systemExpand
Hyper Natural Deduction
  • A. Beckmann, N. Preining
  • Computer Science, Mathematics
  • 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
  • 2015
It is shown that the Hyper Natural Deduction system is sound and complete for infinite-valued propositional Gödel Logic, by giving translations to and from Avron's Hyper sequent Calculus. Expand
Lectures on the Curry-Howard Isomorphism
Preface Outline Acknowledgements 1. Typefree lambda-calculus 2. Intuitionistic logic 3. Simply typed lambdacalculus 4. The Curry-Howard isomorphism 5. Proofs as combinators 6. Classical logic andExpand
Hypersequents, logical consequence and intermediate logics for concurrency
  • A. Avron
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 2005
This paper shows that by using hypersequents, a hypersequential generalization of intuitionistic sequents, one can construct cut-free systems for some intermediate logics (including Dummett's LC) which have simple algebraic semantics that suffice, e.g., for decidability. Expand
A Lambda Calculus for Gödel-Dummett Logic Capturing Waitfreedom
A typed lambda calculus based on Avron's hypersequent calculus for Godel---Dummett logic turns out to model waitfree computation and soundness and completeness are given against the typed version of waitfree protocols. Expand
Proof analysis beyond geometric theories: from rule systems to systems of rules
  • Sara Negri
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 2016
The method provides analytic proof systems for all the modal logics in the Sahlqvist fragment and a generalization of the first-order Barr theorem is shown to follow as an immediate application. Expand
Session Types as Intuitionistic Linear Propositions
This paper introduces a type system for the π-calculus that exactly corresponds to the standard sequent calculus proof system for dual intuitionistic linear logic, and provides the first purely logical account of all features of session types. Expand