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