Philosophy 2340
Symbolic Logic
Language, Proof, and Logic
Notes on Chapters 5 and 6
Now we return to doing proofs. Last time we did proofs, we had only the =Intro, =Elim, and Reit rules.
Now, however, we have added three logical connectives to our arsenal

Philosophy 2340
Symbolic Logic
Notes on Barwise and Etchemendy,
Language, Proof, and Logic, Chapter 7
Curtis Brown
(Note: symbols will not display correctly unless you have the Lucida Sans Unicode font installed.)
Conditionals and Biconditionals: and
Cha

Philosophy 2340
Symbolic Logic
Barwise and Etchemendy, Language, Proof, and Logic
Notes on Chapter 4 (Fun with Truth Tables)
Relations between a number of general concepts and ways to construct precise (but incomplete)
analogs using truth tables. The trut

Chapter 6: Formal Proofs and Boolean Logic
The Fitch program, like the system F, uses introduction and elimination rules. The ones weve
seen so far deal with the logical symbol =. The next group of rules deals with the Boolean connectives
, , and .
6.1 C

Philosophy 2340
Symbolic Logic I
Notes on Barwise and Etchemendy,
Language, Proof, and Logic, Chapter 9
With Chapter 9, we move from (mainly) propositional logic to predicate logic. We will need to extend and
complicate our language.
1. Primitive Symbols

Schedule of Readings and Homework Assignments
2
PHI/LIN 1850 and 1860 (Honors)
"Introduction to Symbolic Logic"
Wayne St. University, Winter 2015
Prof. Eric Hiddleston
Problem sets are assigned on Wednesday, and due by the beginning of
the next class peri

Philosophy 2340
Symbolic Logic
Chapter 2 Notes
Arguments and Logical Validity
An argument is a set of propositions consisting of zero or more premises and a conclusion,
where the premises are intended to give reason to think that the conclusion is true.
W

Philosophy 2340
Symbolic Logic
Advice on Chapter 6 Problems
6.4
This one took me 7 steps (including the premise).
Keep in mind that in order to apply a rule, you need an exact instance of the rule. That is, you must
already have sentences which exactly fi

PHIL12A
Section answers, 23 February 2011
Julian Jonker
1
How much do you know?
1. The following questions are adapted form exercises 5.1-5.6. Decide whether each pattern of inference is
valid. If it is, show that it is using truth tables. If it is not, g

CS103A HO#10
Slides-Formal Proofs with Fitch
10/3/08
Conjunction Elimination ( Elim)
Rules of Inference in Fitch
P1 Pi Pn
Pi
Conjunction Introduction ( Intro)
P1
P2
Elim
Proof 6.3
1. a = b b = c c = d
Pn
.
.
.
P1 Pi Pn
Intro
Goal: a = c b = d
Proof 6.3

Philosophy 2340
Symbolic Logic
Curtis Brown
Chapter 3.1 - 3.3
Up until now, our language has contained only two kinds of expressions (that is, expressions of two
syntactic types): predicates and individual constants. Chapter 3 introduces a new kind of exp

Chapter 5
Informal proofs
Limitations of truth tables
In Chapters 5 and 6 of LPL (and more later) we will look at
proofs. These are valid arguments of a particularly nice
variety.
Though also nice, truth tables have a number of limitations
when it comes t