Help with Simple Tactics
12/22/05
Introduction to Tactics
This video is set in the context of the downloadable program, but it applies equally well in the setting of a proof applet.
12/22/05
This video is set in the context of the downloadable program, but it applies equally well in the setting of a proof applet.
1/8/26 under construction
You may have derivations of your own that you wish to try. Just type, paste, or drag and drop, them into the panel, select your derivation, and click 'Start from selection'.
[Often copy-and-paste won't work directly from a Web Page; however, usually drag-and-drop will work!]
You will need to use the correct logical symbols. Here they are
F ∴ F ∧ G ∼ ∧ ∨ ⊃ ≡ ∀ ∃ ∴
Tutorial 6: Abelian Groups Tutorial 7: Boolean Algebra Tutorial 8: Linearly Ordered Sets Coming sometime!
Theorem 1
| 1 | x=x | =I | ||
| 2 | (∀x)(x=x) | 1 UG | ||
Theorem 2
1/17/20
1/17/20
[This is a film-- press the 'play' symbol.]
Formal Number Theory. Just more theorems for you.
Formal Number Theory has five proper symbols {=,',+, .,0} and six proper axioms
(∀x)(∀y)(x'=y'⊃x=y),
(∀x)~(x'=0),
(∀x)(x+0=x),
(∀x)(∀y)(x+y'=(x+y)'),
(∀x)(x.0=0),
(∀x)(∀y)(x.y'=x.y+x)
And the axiom (metalanguage) schema of induction. If φ[n] is any formula in the object language with free variable n then
(φ[0]∧(∀n)(φ[n]⊃φ[n'])) ⊃ (∀n)φ[n]