Bifalgorithm post · Brisk · Chapter 1

Why is the assertion X ∧ ¬ Y ∧ ¬ ( Z ⇒ X ) impossible?

Why is the assertion X ∧ ¬ Y ∧ ¬ ( Z ⇒ X ) impossible? (Brisk · Chapter 1) — "Q and replace it with X , thus making my asser- tion: “ X ∧ ¬ Y ∧ ¬ ( Z ⇒ X ) .”…

Ideas in this flowchart

  • La nueva afirmación no puede ser verdadera
  • Al reemplazar Q por X se obtiene: X ∧ ¬Y ∧ ¬(Z ⇒ X)
  • El ítem 24 solo podía ser verdadero si la conclusión de la implicación, Q, era falsa
  • En la nueva afirmación, X debe analizarse como verdadero o falso
  • Si X es verdadera, la tercera conjunción ¬(Z ⇒ X) es falsa
  • Si X es falsa, la primera conjunción X es falsa
  • Por tanto, no hay ninguna forma de que el profesor diga la verdad
  • Se asume que todos los profesores son humanos
Feed/

Why is the assertion X ∧ ¬ Y ∧ ¬ ( Z ⇒ X ) impossible?

Channel

Brisk

1 page

"Q and replace it with X , thus making my asser- tion: “ X ∧ ¬ Y ∧ ¬ ( Z ⇒ X ) .” Now what is/are the solutions? Now it’s impossible, and if you study the previous item, you’ll see why. The only way that item 24 could be true was if the con- clusion of the implication (namely, Q ) was false. But X had to be true. So whether X is true or false in this new assertion, some- thing will go haywire: either it’ll be true and the third and-ed thing will be false, or else it’ll be false and the first and-ed thing will be false. There’s no way the professor could be telling the truth here. At the time of this writing, all professors are human, and that’s what I’ll be assuming in these ex- ercises."

Flowchart preview
Series cover
👍
0
0 comments0 shares

Sign in to view and post comments.