|
Re:question on formalism B: msg#00010science.mathematics.frogs
At 11:10 +0100 15.3.05, Lutz Strassburger wrote: I guess that Right. In wired deduction, you have ([A B] [C D]) ([A B] [C D]) s =|==|===| |= s =| |===|==|= [| (| [| |])] [([| |] |) |] s | =|===|==|= vs. s =|==|===|= | , [A (B C) D ] [ A (B C) D] and you cannot transform one derivation into the other simply by moving the horizontal bars up and down. (One could notice that we could permute the pipes, but it's easy to build examples on top of this where the permuting wouldn't work any more.) Of course, this is a patent case of bureaucracy, if we consider the two proofs morally the same. However, this is an example of bureaucracy in the deductive system, not in the formalism. In this case, we can fix the deductive system by simply adding the local rule ([B A] [C D]) ss =|===X===|= . [(B C) A D ] It would be interesting to find geometric and at the same time deductive ways of coping with a situation like this one. -Alessio |
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| Previous by Date: | Wires and pipes: 00010, Alessio Guglielmi |
|---|---|
| Next by Date: | Structures and Deduction Workshop 2nd cfp - ICALP'05 Satellite: 00010, Paola Bruscoli |
| Previous by Thread: | question on formalism Bi: 00010, Lutz Strassburger |
| Next by Thread: | Bureaucracy and identity: 00010, Alessio Guglielmi |
| Indexes: | [Date] [Thread] [Top] [All Lists] |
| News | FAQ | advertise |