maths.free › Set Theory & Logic › Logic and methods of proof

Logic and methods of proof

Connectives, quantifiers, direct proof, contrapositive, contradiction, induction.

A proof is a chain of statements each following from earlier ones by a rule of inference. Direct proof assumes the hypothesis and derives the conclusion; contrapositive proves ¬Q → ¬P instead; contradiction assumes ¬Q and finds an absurdity; induction climbs the integers. Picture it: the truth table below, p → q and ¬p ∨ q agree in every row, which is the contrapositive method justified. Think it: Gödel showed any consistent system rich enough for arithmetic has true statements it cannot prove.

ຕົວຢ່າງ​ທີ່​ໄດ້​ເຮັດ · truth table of (p implies q) iff (not p or q)

Truth table of (p implies q) iff (not p or q)

ຂັ້ນ​ຕອນ​ຕໍ່​ຂັ້ນ​ຕອນ

  1. \left(p \Rightarrow q\right) \Leftrightarrow \left(q \vee \neg p\right)

    2 variable(s) → 4 rows. Fill in every combination.

  2. \

    A tautology (always true).

ເປີດ​ເຜີຍ​ຄຳ​ຕອບ
\left(p \Rightarrow q\right) \Leftrightarrow \left(q \vee \neg p\right)

ປັດຈຸບັນ​ທ່ານ ເລືອກ​ບັນຫາ ຫຼື ພິມ ຫຼື ແຕ້ມ​ເອງ. ທຸກ​ບາດກ້າວ, ຮູບ, ຄໍາຕອບ​ຖືກ​ລົບ​ຈົນ​ກວ່າ​ເຈົ້າ​ຈະ​ຖາມ​ມັນ.

ຮັກສາ​ການ​ເຮັດວຽກ​ຂອງ​ທ່ານ​ໄວ້

ບັນຊີຟຣີ ເພີ່ມ​ຂໍ້​ມູນ​ໃສ່​ບົດຮຽນ​ທຸກ​ບົດ, ບັນທຶກ​ຂອງ​ສິ່ງທີ່​ທ່ານ​ໄດ້​ເຮັດ​ແລ້ວ, ບັນຫາ​ທີ່​ທ່ານ​ໄດ້​ແກ້​ໄຂ​ໄວ້​ໃນ​ບ່ອນ​ດຽວ ແລະ ຄູ​ສອນ​ທີ່​ທ່ານ​ສາມາດ​ຖາມ​ກ່ຽວກັບ​ໜ້າ​ນີ້. ຄະນິດສາດ​ເອງ​ແມ່ນ​ເປີດ​ໃຫ້​ທຸກ​ຄົນ, ບໍ່​ວ່າ​ຈະ​ໄດ້​ເຂົ້າ​ສູ່​ລະບົບ ຫຼື ບໍ່.

ລົງທະບຽນ ចូល

ຕົວ​ສະ​ແດງ​ທີ່​ໃຊ້​ຢູ່​ທີ່​ນີ້

ກົດ​ຕົວ​ອັກສອນ​ໃດ​ໜຶ່ງ​ເພື່ອ​ເບິ່ງ​ຄວາມ​ໝາຍ​ເຕັມ, ຮູບ ແລະ ຕົວອັກສອນ​ແຕ່ລະ​ຕົວ​ໃນ​ມັນ​ໝາຍ​ຄວາມ​ວ່າ​ແນວໃດ.

ວິທີການ: Logic and methods of proof

  1. Write the statement as "if P then Q" with P and Q precise.
  2. Choose a method: direct (assume P), contrapositive (assume not Q), contradiction (assume P and not Q), or induction (for all n).
  3. Each line must cite a definition, an axiom or a previous line.
  4. End when Q appears; mark it ∎.

ຄໍາຖາມທີ່ຄົນຖາມ

Are some infinities bigger than others?

Yes. The integers and the rationals can be listed; the real numbers cannot (Cantor's diagonal argument), so there are strictly more reals than integers.

What is the difference between a relation and a function?

A relation pairs inputs with outputs freely; a function is a relation in which every input gets exactly one output.

ເພີ່ມເຕີມໃນ Set Theory & Logic