|
Re: A cut-free CoS system for S5: msg#00007science.mathematics.frogs
I think I concur with Alessio on the matter of the characterisation of Deep Inference as "fully deep" inference. There's no doubt that even the classical sequent calculus can be seen as an inference system that is somewhat deep: if you think of a sequent of the form X |- Y as consisting of a conditional with a conjunction in the antecedent and a disjunction in the antecedent, then we can make inferences down to that depth. Display logic presentations of modal or other substructural logics allow inferences to go inside more, allowing for existential operators (diamond, or fusion) in antecedent position and universal operators (box, or arrow, or fission) in succedent position, together with a dualising operator. There's no doubt that this allows for more depth, but it doesn't provide a structure in which formulas can be /atomised/, and this is the difference when we compare with CoS. A disjunction in antecedent position cannot be converted into structure. (Its inferential power is exhibited by branching in the sequent derivation: another way that the difference with CoS manifests itself. Here hypersequents and display sequents are on the side of the sequent calculus, and CoS stands apart.) (I'm beginning to form some ideas of why both approaches have their own advantages/disadvantages, but the *detail* is not completely clear to me yet.) I'd be interested to hear if my take on this is thought to be idiosyncratic, or if it's a fair statement of the situation. Best wishes, Greg On 13/06/2005, at 2:36 PM, Alessio Guglielmi wrote:
|
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| Previous by Date: | Re:A cut-free CoS system for S5: 00007, Jon Cohen |
|---|---|
| Next by Date: | Re: A cut-free CoS system for S5: 00007, Charles A Stewart |
| Previous by Thread: | Re:A cut-free CoS system for S5i: 00007, Jon Cohen |
| Next by Thread: | Re: A cut-free CoS system for S5: 00007, Rajeev . Gore-/hejbHI7ObxcYUQs2IXCwA |
| Indexes: | [Date] [Thread] [Top] [All Lists] |
| News | FAQ | advertise |