Switch to: References

Add citations

You must login to add citations.
  1. A geometrical procedure for computing relaxation.Gabriele Pulcini - 2009 - Annals of Pure and Applied Logic 158 (1-2):80-89.
    Permutative logic is a non-commutative conservative extension of linear logic suggested by some investigations on the topology of linear proofs. In order to syntactically reflect the fundamental topological structure of orientable surfaces with boundary, permutative sequents turn out to be shaped like q-permutations. Relaxation is the relation induced on q-permutations by the two structural rules divide and merge; a decision procedure for relaxation has been already provided by stressing some standard achievements in theory of permutations. In these pages, we provide (...)
    Download  
     
    Export citation  
     
    Bookmark