Infinets: The parallel syntax for non-wellfounded proof-theory

Look at the [L #] contraction of Figure 8 and suppose the top and bottom part of the cotensor and par link are not already connected. For a Grishin in- teraction to apply, we need

• we show that the more induction a proof system uses, and the closest its coinduction style to our problem domain of proving reachability-logic formulas, the more compositional

We consider encoding finite automata as least fixed points in a proof- theoretical framework equipped with a general induction scheme, and study au- tomata inclusion in that

The graphical representation of λ-calculus based on linear logic in [10] induced a further calculus with explicit substitutions, the structural λ-calculus [11], isomorphic to

For example, intuitionistic logic was developed to rid (classical) logic of certain logical principles and model checking

Key-words: Proof nets, cut elimination, identity of proofs, correctness criterion, multiplicative linear logic, pomset logic, classical logic... R´ esum´ e : Pas

Second, open markets for proofs can exist where those who need a proof can unambiguously request a proof of a theorem (via an empty certificate) and can unambiguously check that

Strategy III is sound only when the tabled entries are co-inductive predicates: furthermore, a proof certificate can always be constructed and it will be essentially a post-fixed