Don't remember the sugiya, exactly – something in Arbei Pesachim
but it went something like:
Statement, explanation, assertion A; assertion B; counter-example ¬B; assertion C; counter-example ¬C; assertion D; counter-example ¬D.
In terms of decisions based on the text, we had general agreement on A, and most people seemed also to think ¬C, but the Rambam thought C, and it was weird.
It looked as though it came from reading the sugiya two different ways, thus.
One way:
-> statement, explanation, assertion A
<- assertion B (challenging A)
-> refutation ¬B (accepting ¬B and reinstating A)
<- assertion C (challenging A)
-> refutation ¬C (accepting ¬C and reinstating A)
<- assertion D (challenging A) <- refutation ¬D (accepting ¬D and reinstating A)
so you end up with A, ¬B, ¬C, ¬D.
Alternatively:
-> statement, explanation, assertion A
<- assertion B (challenging A)
-> counter-example ¬B (with idea of reinstating A)
-> in support C (supporting ¬B with idea C, hence supporting A)
<- challenge ¬C (challenging C)
-> refutation D (rejecting challenge to C using D)
<- assertion ¬D (challenging C's ability to support ¬B, but ¬B still stands)
now you would pasken A, ¬B, C, ¬D.
Something like that. Not sure exactly, but you get the general idea? Sometimes things are ambiguous enough that you can break the assertion-refutation pattern in different ways such that each read is equally plausible.
but it went something like:
Statement, explanation, assertion A; assertion B; counter-example ¬B; assertion C; counter-example ¬C; assertion D; counter-example ¬D.
In terms of decisions based on the text, we had general agreement on A, and most people seemed also to think ¬C, but the Rambam thought C, and it was weird.
It looked as though it came from reading the sugiya two different ways, thus.
One way:
-> statement, explanation, assertion A
<- assertion B (challenging A)
-> refutation ¬B (accepting ¬B and reinstating A)
<- assertion C (challenging A)
-> refutation ¬C (accepting ¬C and reinstating A)
<- assertion D (challenging A) <- refutation ¬D (accepting ¬D and reinstating A)
so you end up with A, ¬B, ¬C, ¬D.
Alternatively:
-> statement, explanation, assertion A
<- assertion B (challenging A)
-> counter-example ¬B (with idea of reinstating A)
-> in support C (supporting ¬B with idea C, hence supporting A)
<- challenge ¬C (challenging C)
-> refutation D (rejecting challenge to C using D)
<- assertion ¬D (challenging C's ability to support ¬B, but ¬B still stands)
now you would pasken A, ¬B, C, ¬D.
Something like that. Not sure exactly, but you get the general idea? Sometimes things are ambiguous enough that you can break the assertion-refutation pattern in different ways such that each read is equally plausible.