Syllogistic unity

29
Syllogistic Unity Proving the Equivalency of All Syllogisms Using Object Logic Armahedi Mahzar © 2011

description

Proving the equivalence of all valid syllogism using the pictorial object logic

Transcript of Syllogistic unity

Page 1: Syllogistic unity

Syllogistic Unity

Provingthe Equivalency of All

Syllogisms

Using Object Logic

Armahedi Mahzar © 2011

Page 2: Syllogistic unity

Foreword� Logic is the science of thinking as it is

discovered by Aristotle. In his treatise of syllogism he used alphabets to represent concept in his verbal logic. George Boole created an algebra of logic by representing logical operations with mathematical symbols besides letters as variables. These symbolizations is still linear literal.

� Charles Sanders Peirce rewrote booleanalgebra in a planar pictorial symbols by using pictures as the symbols of logic, but he still used alphabets as the symbols of variables. The pictorial symbolization is also used by George Spencer-Brown having a half of a box, which he called cross, to replace the ovals of Peirce

� Louis Kauffman replaced the Brownian cross with a complete box in his pictorial Box Algebra of logic.

� In the following slides we will make the Box Algebra more pictorial, by replacing letters with colored objects to get an Object Logic.

� Finally, we will use the Object Logic to prove the astounding fact of Syllogistic Unity.

Page 3: Syllogistic unity

Part One: Logic Algebra of Objects

In this part the Boolean algebra is made pictorial by

Replacing letters with colored objects

Replacing mathematical symbols with boxes configuration

Page 4: Syllogistic unity

LOGICAL NOTATION

Page 5: Syllogistic unity

Two Interpretations of Kauffman Box Algebra

� Kauffman Box algebra is a rewriting of the Spencer-Brown “Laws of Form” Algebra

� But it can also be interpreted as rewriting of the Existential Graph Algebra of Peirce

� The following presentation follows Peircean interpretation with colored marbles as variables

Page 6: Syllogistic unity

FUNDAMENTAL LAWS OF LOGIC

LAWS OF NEGATION

� NOT TRUE = FALSE

� NOT FALSE = TRUE

LAWS OF CONJUNCTION

� TRUE AND TRUE = TRUE

� TRUE AND FALSE = FALSE

� FALSE AND TRUE = FALSE

� FALSE AND FALSE = FALSE

Page 7: Syllogistic unity

Basic Box Arithmetic

� LAW OFNEGATION

� LAW OF CONJUNCTION

From this Box Arithmetic we can build a logic algebra discovered by George Boole. Alfred North Whitehead and Bertrand Russel derived the whole Boolean Algebra on five axioms. George Spencer-Brown reduced the axiom into just two axiom in his Laws of Form Primary Algebra. Louis Kaufman reduced the axioms to just one in his Box Algebra.

Page 8: Syllogistic unity

Axiom of the Logic Box Algebra

� The single Axiom for Logical

Box Algebra is Huntington tautology

Page 9: Syllogistic unity

The Meaning of the Axiom:Reductio ad Absurdum

� The Huntington Axiom box diagram is

The diagram can be read as

� Red is Trueif and only if Not Red implies Blue and Not Red implies Not Blue

which is equivalent to

� Red is Trueif only ifNot Red implies a Contradiction

the Reductio ad Absurdum principle

Page 10: Syllogistic unity

Rules of Inference

� Rule of Substitutionany variable can be replaced by a function of other variables

� Rule of Replacementa function of variables can be replaced by another equivalent function of the same variables

Using these rules we can derive all Boolean tautologies, some of them is in the following page.

Page 11: Syllogistic unity

Agebraic Identities(logical tautologies) are theorems

� Law of Absorption

� Law of Negation

� Law of Contradiction

� Law of (De)iteration

Page 12: Syllogistic unity

Implication in BOX algebra

Logical Proposition

� IF p THEN q = TRUE

� NOT p OR q = TRUE

� p AND NOT q = FALSE

� NOT (p AND NOT q)= TRUE

� In the NAND box algebra notation it is represented by

In Boolean Notation

� (p � q ) = 1

� p’ + q = 1

� p x q’ = 0

� (p x q’ )’ = 1

Page 13: Syllogistic unity

Part Two : Syllogism

In this part we will reformulate syllogism in a boolean formula which is drawn as picture of enclosing boxes containing colored objects that represents concepts.

Page 14: Syllogistic unity

Syllogism as an Implication

� “IF p AND q THEN r”represented by

� p, q and r are fundamental propositions

� p and q are premises

� r is conclusion

Page 15: Syllogistic unity

Aristotle Fundamental Propositions

Page 16: Syllogistic unity

Facts of Syllogism

� Every Valid Syllogism is a Tautology

� Leibnitz proved that there are only 24 Valid Syllogisms

� We will use the NAND interpreted box algebra of Kauffman to prove� The syllogistic unity: all

valid syllogisms is equivalent to each other

Page 17: Syllogistic unity

The names of the valid syllogisms are

� Using symmetric properties and Boolean Identity , we have only to prove just the Barbara syllogism validity.

Page 18: Syllogistic unity

BARBARA syllogism

� Syllogism Barbara = [[b[c]][a[b]]a[c]]

Page 19: Syllogistic unity

Proof of the validity of Barbara Syllogism

(All Red is Green & All Green is Blue � All Red

is Blue)=TRUE

= = = =

deiteration absorption

contradiction negation

Page 20: Syllogistic unity

Part 3 : Syllogistic Unity

In this part we will prove the unity of valid syllogisms by using its permutational symmetry, the algebraic substitution and the equivalency of different algebraic expressions

Page 21: Syllogistic unity

STEP 1: Barbara Triad

� Barbara, Baroco and Bocardo are equivalent to each other. All can be represented by single box diagram

� BarbaraAmp Asm ����

Asp� BarocoApm Osm ����

Osp� BocardoOmp Ams ����

Osp

Page 22: Syllogistic unity

STEP 2: Celarent Zodiac

� The twelve syllogisms are equivalent to each other. All can be represented by a single box diagram

� Camestres: Arg Egb ���� Ebr

� Camenes : Arg Ebg ���� Ebr

� Celarent : Egb Arg ���� Erb

� Cesare : Ebg Arg ���� Erb

� Datisi : Arg Ibr ���� Ibg

� Darii : Arg Irb ���� Ibg

� Disamis : Ibr Arg ���� Igb

� Diramis : Irb Arg ���� Igb

� Ferio : Egb Irb ���� Org

� Ferison : Ebg Irb ���� Org

� Festino : Egb Ibr ���� Org

� Fresison : Ebg Ibr ���� Org

Page 23: Syllogistic unity

STEP 3: Celaront Triad

� Celaront, Cesaro and Darapti are equivalent to each other. All can be represented by single diagram

� CelarontEmp Asm ����

Osp� CesaroEpm Asm ����

Osp� Darapti Amp Ams ����

Isp

Page 24: Syllogistic unity

STEP 4: Barbari Hexad

� Barbari, Camestros, Felapton, Bramantip, Calemos and Fesapo are equivalent to each other. All can be represented by single box diagram

� Barbari Amp Asm ���� Isp

� Camestros Apm Esm ���� Osp

� Felapton Emp Ams ���� Osp

� BramantipApm Ams ���� Isp

� CalemosApm Ems ���� Osp

� FesapoEpm Ams ���� Osp

Page 25: Syllogistic unity

Step 5: Syllogistic Equivalence

� Barbara = Celarent

� by substituting

with

� Celarent = Barbari

� by replacingwith

� Celarent = Celaront

� by replacing with

Page 26: Syllogistic unity

24valid

syllogisms

Page 27: Syllogistic unity

Conclusion: Syllogistic Unity

� Due to

� all the members of the Barbara triad, Celarent zodiac, Barbari hexad and Celaront triad are equivalent to each other, and

� the equivalency of Barbara-Barbari-Celarent-Celaront,

� all of the 24 syllogism is a member of a single equivalent class: the union of the four classes.

� This fact can be called as the Syllogistic Unity

Page 28: Syllogistic unity

Afterword� The fact of syllogistic unity is

anticipated by Christine Ladd-Franklin who had shown that all valid syllogisms can be derived from her particular antilogism formula:

� In fact the formula is just one of the 24 valid antilogisms which are equivalent to each other, from each of them we can also derive all valid syllogism.

Page 29: Syllogistic unity

References

� Aristotle :� Non-Mathematical Verbal Logic

http://classics.mit.edu/Aristotle/prior.1.i.html

� George Boole:� Algebraic Symbolic Logic (Algebra of Logic)

http://www.freeinfosociety.com/media/pdf/4708.pdf

� Charles Sanders Peirce:� Algebraic Graphical Logic (Existential Graph)

http://www.jfsowa.com/peirce/ms514.htm

� George Spencer-Brown:� Algebraic Graphical Logic (Laws of Form)

http://www.4shared.com/document/bBAP7ovO/G-spencer-Brown-Laws-of-Form-1.html

� Louis Kauffman: � Algebraic Pictorial Logic (Box Algebra)

http://www.math.uic.edu/~kauffman/Arithmetic.htm