
Jonathan K. answered 04/15/20
MA in Philosophy, Taught Logic at Moravian College and Baruch College
The way to think about this in sentential logic is that if you have 4 statements, and at most 2 are true, then at least 2 are false. The way to say that at least 2 statements are false is to enumerate the ways that can happen, and say that at least one of those ways is true. In this case, that would be:
(¬B ∧ ¬D) ∨ (¬B ∧ ¬A) ∨ (¬B ∧ ¬R) ∨ (¬D ∧ ¬A) ∨ (¬D ∧ ¬R) ∨ (¬A ∧ ¬R)
If you were doing this in quantificational logic, where you schematize the sentences as Pb, Pd, Pa, and Pr respectively, then the way to think about this is that if 3 people reach the top of the peak, then at least two of them are actually the same person:
(∀x)(∀y)(∀z)((Px ∧ Py ∧ Pz) ⊃ (x=y ∨ x=z ∨ y=z))