Chapter 4
Sentential Logic:
Truth-Trees
4.1 The Truth-Tree Method
In Chapter 3 we saw that the semantic
concepts of sentential logic can be
explicated in terms of truth-functional
consistency.
In thi
ASSIGNMENT 1 ANSWERS
1. a. An argumentis a set of sentences one of which (the conclusion) is taken to be supported by
the remaining sentences (the premises).
b. A sentence is logically falseif and onl
ASSIGNMENT 5
1. Define
a. Inconsistency in SD
b. Equivalence in SD
2. Construct derivations in SD that establish parts a and b below.
a. The following sentence is a theorem in SD:
( A B) (A B)
b. The
Introduction to Symbolic Logic
Department of Philosophy
Spring 2016
University of California, Davis
Assignment 2 Solutions (The Logic Book, Chapter 2)
1.
Give a truth-functional paraphrase of each of
ASSIGNMENT 2 ANSWERS
1. a. If Mary is here then Mary will tell us how to set the lenses.
MT
b. It is not the case that both Bill will be able to come today and Rob
will be able to come today.
(B & R)
ASSIGNMENT 4 ANSWERS
1. a. A sentence P of SL is truth-functionally true if and only if the set cfw_ P has a closed truthtree.
b. An argument of SL is truth-functionally valid if and only if the set c
ASSIGNMENT 3 ANSWERS
1. a. Sentences P and Q of SL are truth-functionally equivalent if and only if there is no truthvalue assignment on which P and Q have different truth-values.
b. An argument of SL
Chapter
1
Basic Notions of Logic
1.1 Background
Sentential
logic: this is the branch of
symbolic deductive logic that takes
sentences as the fundamental unit of logical
analysis.
Predicate logic: thi
Chapter
5
Sentential Logic:
Derivations
5.1 The Derivation System SD
When evaluating an argument we often try to
show that its conclusion can be deduced or
derived from its premises.
Semantics is conc
Chapter
2
SL: Symbolization and
Syntax
2.1 Symbolization and TruthFunctional Connectives
SL: branch of symbolic deductive logic in which
sentences are the basic units of logical analysis.
Recall: we a
ASSIGNMENT 5 ANSWERS
1. a. A set of sentences of SL is inconsistent in SD if and only if a sentence P and its negation
P are derivable in SD from .
b. Sentences P and Q of SL are equivalent in SD if
PHI12 - Chapter 1
Sunday, January 8, 2017
PHI12 Chapter 1
8:52 PM
Scroll down to see the slides.
These slides are used as standard slides for Phi 12 and they
may be slightly different from the slides
Chapter 2
Syntax and Symbolization
u Sentential Logic or SL: branch of symbolic deductive logic in
which sentences are the basic units of logical analysis.
u The syntax of a language specifies the bas
Philosophy 12
INTRODUCTION TO SYMBOLIC LOGIC
Winter 2017
Homework 4
1.
Explicate in terms of open and/or closed truth-trees:
(5 pts. each)
a.
Truth-functional consistency*
b.
Truth-functional truth
c.
Philosophy 12
INTRODUCTION TO SYMBOLIC LOGIC
Winter 2017
Homework 1
1. Define the following: (2 pts. each)
a. Argument
b. Logical falsity
c. Logical validity
2. For each of the following, indicate whe
Philosophy 12
INTRODUCTION TO SYMBOLIC LOGIC
Winter 2017
Homework 1
1. Define the following: (2 pts. each)
a. Argument: an argument is a series of statements typically used to
persuade someone of some
Introduction to Symbolic Logic
Department of Philosophy
Spring, 2016
University of California, Davis
Assignment 4 (Covers Chapter 4)
1.
Explicate in terms of open and/or closed truth-trees:
a.
Truth-f