Recent content by Marie120

Thank you! Hi Sorry for my late reply, but I just wanted to say thank you to both Loseyourname and Bartholomew for taking the time to muse over my question. Though I don't have the time right now to apply your solutions to my problem, I definitely will soon. Have a great New Year! :smile:

If what you're seeking to prove can be proven using SD+, then it can be proven using SD. Since SD+ basically gives rules that work as shortcuts, shouldn't it be easier for me to prove that a set of sentences is inconsistent using SD+ and SD than it currently is?

Why is SD+ so difficult? I understand SD, but SD+ is eluding me..

Good evening. Would anybody in this room be able to help me with an SD+ question? My question is as follows: Show that the following set of sentences is inconsistent in SD or SD+: {(~C v (E & P)) (triple bar) B, ~E > ~C, ~(P & B) & ~(~P & ~B), B > C}