Friday, January 29th, 1982

WISDOM'S GOLDENROD, ALAN BERKOWITZ CLASS NOTES

(TYPED)

JANUARY 29, 1982

SCIENCE; MATHEMATICAL LOGIC

TOPIC: Science

SUBJECT: Mathematical Logic

SUBSUBJECTS: Symbolic Logic, Leibniz

TYPED AND REFORMATTED by IT 2023

NOTES:

• RETYPED HANDWRITTEN NOTES (hence V08). From Classnotes AB 1982 0101 to 1982 0207.PDF.

• This event is among those in later 1981/early 1982 when Anthony was exploring Astrology/the Zodiacs, Cosmology, Physics, Logic, Astronomy, Soul, Nature, and The Grid: Gnostic and Fabricative.

• All spelling, capitalization, and punctuation corrected, abbreviations spelled out.

1982 01/29 at Wisdom's Goldenrod

Science; Mathematical Logic

[Classnotes AB 1982 0129 Begin]

1/29/82 Symbolic Logic

Predicate logic is based on Leibniz's scheme (concept script).

p, q -- assertions

1. denial = ¬ : ¬ p (it is not the case that p, or not p)

2. conjunction = and (˄): p ˄ q

3. disjunction = or (˅): p ˅ q

4. If-then = the conditional p → q

If p then q, p implies q.

Combine to make a schema or form of a sentence.

¬ p → ((p ˅ q) → q)

Any substitution in this case gives a true sentence.

Not p implies that if p or q is true, then q is true = a tautology (truths which are trivially true).

This sentence is universally true --

Two schemas are equivalent if they "mean" the same.

The truth value of a scheme is not decided by substituting meanings for p's and q's but by constructing a truth table.

[In reference to second table]: To solve for this [fifth column] first solve for its components [first four columns].

The language of predicate logic is adequate to express mathematics.

[Classnotes AB 1982 0129 End]