Add to ORKGAbstract. We use a deep embedding of the display calculus for relation algebras RA in the logical framework Isabelle/HOL to formalise a machine-checked proof of cut-admissibility for RA. Unlike other “implementations”, we explicitly formalise the structural induction in Isabelle/HOL and believe this to be the first full formalisation of cutadmissibility in the presence of explicit structural rules.
A recent strand of research in structural proof theory aims at exploring the notion of analytic calc...
Proofs of cut elimination have took two different ways for a long time: syntac-tic cut reduction and...
We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calc...
We use a deep embedding of the display calculus for relation algebras RA in the logical framework I...
We describe a deep embedding of the display calculus ÆRA, for relation algebras, using Isabelle/HOL....
We use a deep embedding of the display calculus for relation algebras #RA in the logical framework I...
We use a deep embedding of the display calculus for relation algebras δRA in the logical framework I...
AbstractWe use a deep embedding of the display calculus for relation algebras δRA in the logical fra...
AbstractLogical frameworks are computer systems which allow a user to formalise mathematics using sp...
International audienceWe define cut-free display calculi for knowledge logics where an indiscernibil...
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent cal...
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the dept...
What can (and what cannot) be expressed by structural display rules? Given a display calculus, we pr...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
A recent strand of research in structural proof theory aims at exploring the notion of analytic calc...
Proofs of cut elimination have took two different ways for a long time: syntac-tic cut reduction and...
We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calc...
We use a deep embedding of the display calculus for relation algebras RA in the logical framework I...
We describe a deep embedding of the display calculus ÆRA, for relation algebras, using Isabelle/HOL....
We use a deep embedding of the display calculus for relation algebras #RA in the logical framework I...
We use a deep embedding of the display calculus for relation algebras δRA in the logical framework I...
AbstractWe use a deep embedding of the display calculus for relation algebras δRA in the logical fra...
AbstractLogical frameworks are computer systems which allow a user to formalise mathematics using sp...
International audienceWe define cut-free display calculi for knowledge logics where an indiscernibil...
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent cal...
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the dept...
What can (and what cannot) be expressed by structural display rules? Given a display calculus, we pr...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
A recent strand of research in structural proof theory aims at exploring the notion of analytic calc...
Proofs of cut elimination have took two different ways for a long time: syntac-tic cut reduction and...
We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calc...