Logic PHIL2001A Elisabeta Sarca -TEST 2 Practice
Name_
ATTENTION: All responses (where applicable) should show clear evidence of the work
through which you reached the answer. Do not forget to write your name on the exam!
book!
Translate into propositiona
PHIL 2001
Introduction to Symbolic Logic
Lecture 1
PHIL 2001
Introduction
PHIL 2001
Admin Matters
Instructor: Prof. Gabriele Contessa
Office: PA 3A43 (Paterson Hall)
Office Hours: Wednesdays 1:35pm2:35pm or
by appointment
E-mail: [email protected]
Logic PHIL2001A Elisabeta Sarca -TEST 2 Practice
Name_
ATTENTION: All responses (where applicable) should show clear evidence of the work
through which you reached the answer. Do not forget to write your name on the exam!
book!
Translate into propositiona
Logic 2001A Elisabeta Sarca TEST 3 Practice
Translate into quantificational logic (2 points each):
1. No superhero is a lean and mean villain-fighting machine.
~(x)(Sx Vx) (Lx Mx)
2. Either not everyone is a shape-shifter or not anyone is.
(~(x)Sx v ~(x)S
Logic PL264 Elisabeta Sarca -QUIZ 1
Name_
Translate into syllogistic logic and say whether valid or invalid.
4 points each
Some intentional killings are not punishable offenses, inasmuch as all cases
of self-defense are unpunishable offenses, and some int
Syllogistic Logic
Sample Quiz
Translate into syllogistic logic
and say whether valid or invalid.
You must be the criminal. Im sure of this, because you
walk with a slight limp. We all know that the criminal
walks with a slight limp.
All who use Macintosh
Logic PL264 Elisabeta Sarca -QUIZ 1
Name_
Translate into syllogistic logic and say whether valid or invalid.
Some intentional killings are not punishable offenses, inasmuch as all cases
of self-defense are unpunishable offenses, and some intentional killi
Propositional Proofs
Sample Quiz
Translate into propositional logic. Say
whether VALID (then give a formal proof)
or INVALID (then give a refutation).
If smoke in the office is a problem, then theres bad
ventilation.
If theres bad ventilation, then thered
S- and I-rules (Sections 6.10, 6.11, & 7.1) front of flash card
(A B)
(A B)
(A B)
(A B)
(A B)
(A B)
(A B)
A
(A B)
A
(A B)
A
(A B)
B
(A B)
B
(A B)
B
(A B)
A
(A B)
A
(A B)
A
(A B)
B
(A B)
B
(A B)
B
A
(A B)
(A B)
S- and I-rules (Sections 6.10, 6.11, & 7.1) b
PHIL 2001: Introduction to
Logic
Todays Topic: Review for Tests 1 & 2
My Email: [email protected]
My Oce Hours: 3A64 Paterson Hall
Mondays and Wednesdays 11:15am-12:45pm
Multiple Choice
1- An argument is invalid if:
(a) it is possible for all of its
PHIL 2001
INTRODUCTION TO SYMBOLIC LOGIC
Term: Winter 2015
Meetings: Tuesday and Thursday: 2:35-3:55pm
Venue: Minto Centre 2000
Instructor: Jordan Dodd
Office: 3A64 Paterson Hall
Office hours: TBD
Email: [email protected]
1. Course description
This
PHIL 2001 Test #1 Key - Version 1
Version 1 is indicated by the page numbers on all pages, including the answer sheet,
having no asterisk before them. E.g., the page number on the answer sheet is given as
p.8. Version 1 and Version 2 have the same questio
PHIL 2001: Introduction to Symbolic Logic
Test #3
*2 of these 3 questions will appear on Test#3*
*The instruction will be: Answer all of the following questions*
[Note: Though I said in class that the long answer questions would be worth 10 marks each, I
Name: _
Student ID: _
Sector: _
Row: _
PHIL 2001
Test 2
(1)
(2)
Check the box if and only if f(x): AB is a (total, single-valued) injective function: (10%)
(1a) A=cfw_1, 2, 3; B = cfw_a,
PHIL 2001
Introduction to Logic
Lecture 10
Lecture 10
PHIL 2001
1
Predicate Logic
Semantics: Models
Lecture 10
PHIL 2001
2
c
a
b
f
Lecture 10
e
d
g
PHIL 2001
h
3
a
g
c
d
h
e
f
Lecture 10
b
PHIL 2001
4
b
d
a
e
g
c
f
Lecture 10
h
PHIL 2001
5
Properties and
PHIL 2001
Introduction to Symbolic Logic
Lecture 3
Functions
Lecture 03 (Functions)
PHIL 2001
3
Functions
A function (f(x): A B) is an entity that associates
members of one set (its domain (A) with members
of another set (its co-domain (B).
The elements
PHIL 2001
Introduction to Symbolic Logic
Lecture 2
Sets
Lecture 02 (Sets)
PHIL 2001
2
Lecture 02 (Sets)
PHIL 2001
3
Nave Set Theory
Today we are going to have a look at Nave Set
Theory (NST).
NST is the set theory you learned in school.
NST is inconsis
Name _
Student ID _
PHIL 2001
Assignment 2
1)
Determine whether or not the following functions from A to B are total (T), single-valued (SV), injective (I),
and/or surjective (S) and check all c
Name
_
Student ID _
Due: February 2, 8:35am
PHIL 2001
Assignment #3
1)
Check the box if and only if the string of symbols belongs to PROP (i.e. the set of propositions of PL). (25%)
(p88p88)(p88p88)(p88p88)(p88p88)
(p55p66)(p66)
(p45)
2)
3)
4)
a)
( ) ( )
Name _
Deadline: January 20
PHIL 2001
Assignment #1
1)
Fill in the blanks so that =(AB) (25%) (It is possible that there is more than one correct answer!)
a)
A = cfw_a, b, c
b)
A = cfw_a
B = cfw_c, d
Name _
Student ID _
PHIL 2001
Assignment #4
1)
Determine the truth-table for each of the following meta-propositions: (20% each)
(1a)
( ) () )
)
(
)
(
1
1
1
1
0
)
1
1
1
PHIL 2001
Introduction to Symbolic Logic
Lecture 4
PHIL 2001
Propositional Logic
Syntax: Propositions
PHIL 2001
2
Bert (rolls over and sits up in bed): Ernie?
Ernie: Yes, Bert?
Bert: Oh, Ernie, what are you doing with those cookies in bed, huh?
Ernie: Oh,
PHIL 2001
Introduc0on to Logic
Lecture 5
Lecture 05
PHIL 2001
1
Proposi0onal Logic
Seman0cs: Truth-Tables
Lecture 05
PHIL 2001
2
Truth and Bivalence
Excluded Middle: No
proposi0on is neither
true nor false.
Bivalence:
PHIL 2001
Introduction to Logic
Lecture 7
Lecture 07
PHIL 2001
1
Propositional Logic
Syntax: Derivations
Lecture 07
PHIL 2001
2
Syntax
Lets pretend we dont know anything
about the meaning of the symbols of
(restricted) propositional logic (RPL).
We only k
PHIL 2001
Introduc0on to Logic
Lecture 6
Lecture 06
PHIL 2001
1
Proposi0onal Logic
Seman0cs: Logical Consequence
Lecture 06
PHIL 2001
2
Tautologies, Contradictions, and
Contingencies
Def 6.1: is a tautology ( ) for all
PHIL 2001
Introduction to Logic
Lecture 9
Lecture 09
PHIL 2001
1
Predicate Logic
Syntax: Formulas
Lecture 09
PHIL 2001
2
1. If youll eat cookies in bed, then youll
get crumbs in the sheets.
2. If youll get crumbs in the sheets,
then youll get crumbs in yo
PHIL 2001
Introduction to Logic
Lecture 9
Lecture 08
PHIL 2001
1
Propositional Logic
Meta-Theory: Soundness and
Completeness
Lecture 08
PHIL 2001
2
Soundness and Completeness
After looking at the syntax and the semantics of Propositional
Logic, in this le
Propositional Logic
It investigates the relationships
among entire propositions to
determine the validity of arguments
Elisabeta Sarca
Notation
Variables
Operators (connectives)
Only CAPITAL letters,
standing for complete
PROPOSITIONS.
Propositions = un
What Is Logic?
It is the study of correct reasoning.
The main building blocks of reasoning
are ARGUMENTS.
Elisabeta Sarca
Arguments
An argument is a set of
propositions (sentences
that can be either true or
false), in which one called
the CONCLUSION is se
Propositional Proofs
This is an additional method for checking validity of
arguments. Propositional proofs proceed step by step
from the premises to the conclusion, through a series of
simpler valid arguments.
Elisabeta Sarca
3 New S-Rules: DN, IFF, NIFF
S- and I-rules (Sections 6.10, 6.11, 87: 7.1) front of ash card S- and Irules (Sections 6.10, 6.11, &- 7.1) back of ash card
A, B
A, ~B ~A, ~B
B ~B
~A
B
~A A
(A v B), (A :3 B), A
~(AB) (133A)
Quantificational logic (Sections 8.1 & 8.4) front of flash card
All bears
are furry.
Nothing is
a mean bear.
No old bear
is mean.
Some bears
are mean.
Not every
furry bear
is mean.
Every bear
who is old
is mean.
No bears
are mean.
Some
old bears
are mean.