6 Jul 2004 19:06
Re: Light logics vs. CoS
Ugo, I only found very little time to work on that: I think you're
right, my proposal doesn't work and right now I have no constructive
suggestion. I hope I'll find some time to work on this. For now, I go
on holiday! -Alessio
At 9:47 AM +0200 11.6.04, Ugo Dal_Lago wrote:
> > At 17:32 +0200 10.6.04, Ugo Dal_Lago wrote:
>> > > What about
>> >>
>> >> S{![R,T]}
>> >> ----------- ,
>> > > S{![!R,?T]}
>> >>
>> >> together with !1 = 1, of course?
>> >
>> >I am not able to understand your intuition. If you can freely use
>> >this rule, you can build a derivation such as the following:
>> >
>> > ![[a,a,a],b]
>> > ----------------
>> > ![![[a,a],a],?b]
>> > ------------------
>> > ![![![a,a],?a],?b]
>> > ------------------
>> > ![![!a,?a,?a],?b]
>> >
>> >If you map structures to "equivalent" sequents in the usual way, you
>> >can prove much more than what you prove in LAL...
>>
>> No, with my rule the bottommost inference in your example is
(Continue reading)
RSS Feed