Episode 7 Details
Download: |ogg| - |mp3|
Hosts:
XlogicX
Medicine_Soup
Disclaimer:
scripted by XlogicX
based on Jackass
recorded by anonymous voice
sped up 50% by Audacity
Show Notes:
Email 1:
From yauch:
I've been waiting 2 years for sombody in the h/p indy internet radio scene to use that nofx track for an intro or outro. I think it represent the old biafra slogan of "Be the media" quite well.
-yauch
Email 2:
From heprimm:
Hey XlogicX,
Just a quick note to say that I've been enjoying Antimeme since I listened to episode 1. It's nice breath of fresh air from a lot of the other hacker radio shows. The constrict of time means that there's never dead air or "So... what're we gonna talk about?" moments.
Keep it up,
heprimm
On a personal note, I've learned so much from all of the other shows and still listen to them; it's all fresh air to me.
Logic
- The process of taking statements in, and spitting out conclusions that were not in the statements previously made.
- Furthermore, assuming all of the statements put into the process were true, the conclusion would be guaranteed to be true.
- To put in another perspective, it would be impossible to have a false conclusion with all input being true.
- Logic is a truth processing machine.
- The logical process can be compared to a computer process; you have input, processing, and then output.
Input
- The terminology of input in logic is a premise; an input statement is a premise. It is such a statement that much resolve to either true or false:
: it is raining (could either be true or false)
: My skin is green (could either be true or false)
: is my skin green? (not a premise, its a question)
: Make it rain! (not a premise, it's a command)
Output
- The terminology of output in logic is a conclusion, conclusion statements can be resolved as true or false (usually follows a “therefore”)
Processing
- The terminology of processing in logic is called an inference. This is the process that allows one to take premises and spit out conclusions.
Some other key terms are Validity and soundness.
Validity
- This is where all true premises will guarantee a true conclusion
- invalidity is where the premises do not support the conclusion, another case is if the conclusion is false and the premises are all true (the process is invalid). Though you could also have a true conclusion with irrelevant premises (though true even).
Soundness
Not only is a sound argument valid, but all of the premises are actually true
If the Earth is flat, Then the water would fall off Ocean
The Earth is indeed flat
Therefore, the water would fall off Ocean
If E Then O
E
Therefore O
Symboloic Logic
Converting all truth valued statements into symbols
If a sentence has one or more truth statement, connect the symbols with an operation (and, or, not, if then).
Reasoning for using symbolic logic is simplicity and more readily usable for proofs.
Also takes bias and subjectivity out of it.
There are two main ways to practice logic:
Proofs
- Using proofs, you can use some fundamental inference structures as axioms and reach theorems from there. This is a free form style of proving conclusions.
Truth tables
- If a proof is an example of C++, truth tables would be an example of assembly language. Truth tables are a lower level way to solve for validity of a conclusion.
- With a truth table, you already have a conclusion in mind; you are trying to show if it can be validly proven with the given information (A very powerful tool)
-The process usually takes longer than using a proof, but it is more mechanical; meaning easier to apply. Whereas using the method of proofs can take some intuition in where to go.
Examples of Proofs
Inference Modus Ponens (Mode that affirms)
If A then B, we have A, therefore we have B
Proof 1
---------------------------------
Premis 1: If A then B
Premis 2: A
Conclusion: B
Given information:
If it is raining, then there were clouds nearby
We know it's raining.
Symbolize:
A = It is raining
B = there were clouds nearby
Proof:
Premis 1: If A, Then B
Premis 2: A
---------------------------------
Conclusion: B (by rule of modus ponens)
Proof 2:
---------------------------------
If it's raining, then there were clouds nearby
Its raining or kittens are dying
kittens are not dying
It is raining
Therefore there were clouds nearby
Symbolize
A = It's raining
B = there were clouds nearby
C = kittens are dying
Proof:
Premis 1: If A Then B
Premis 2: A or C
Premis 3: Not C
Premis 4: A (by inference of disjunction [premise 2 and 3])
Conclusion: B (by inference of Modus Ponens [premise 1 and 4])
Truth tables
Basic functional truth tables
AND
OR
IF Then
NOT
Strategy of using truth tables:
Assuming statements are symbolized.
Step one: Take all “atomic” symbols and put them in a table to list all possible combinations.
Step two: Include the rest of the premises as columns next to atoms (if there are other premises other than atoms)
Step three: List conclusion that you're testing for as the last column.
Step four: Highlight each column that has a premise.
Step five: Highlight each row where all premises are true.
Step six: If the conclusion is true in all highlighted rows, the conclusion is reached in validity.
Truth table for Modus Ponens:
Step 1:
Step 2:
Step 3:
Step 4:
Step 5:
Step 6:
Modus Ponens is a valid inference by truth table.
Truth table for previous proof:
If it's raining, then there were clouds nearby
Its raining or kittens are dying
kittens are not dying
Symbolized
Premise 1: If A Then B
Premise 2: A or C
Premise 3: Not C
Step 1:
Step 2:
Step 3:
Step 4:
Step 5:
Edit - The 3rd row is not highlighted; not all premisies are true.
Step 6:
Edit - Ditto
This argument is valid by truth table.
Commercial:
Cricket Wireless - Income Tax Freedumb
-Income tax returns have nothing to do with why you should purchase Crocket service
Links:
The shows I have gained to most from
Binary Revolution
RFA
<-- Back