Chapter 1
First-Order Logic
This chapter develops first-order logic, i.e., logic with universal and existential quantifications. Developing first-order logic is the first step toward a practical reasoning system which inevitably demands an
apparatus for e

Name:
Hemos ID:
CSE-433 Logic in Computer Science 2007
Midterm exam Sample Solution
This is a closed-book exam. No other material is permitted.
It consists of 4 problems worth a total of 140 points and an extra-credit problem worth 35 points.
There are

Chapter 1
Classical Logic
Unlike constructive logic which is usually explained operationally by associating each proposition A
with a proof proving or refuting its truth, classical logic is a logic that is usually explained denotationally
by associating e

Chapter 1
Propositional Logic
This chapter develops propositional logic, i.e., logic without universal or existential quantifications. We
formulate propositional logic in the judgmental style of Pfenning and Davies [?], which adopts Martin
Lofs
methodolog

Chapter 1
Proof Terms
This chapter presents an alternative formulation of propositional logic using the principle called the
Curry-Howard isomorphism [?]. As a principle connecting logic and programming languages, it states that
propositions in logic corr

Name:
Hemos ID:
CSE-433 Logic in Computer Science 2007
Midterm exam
This is a closed-book exam. No other material is permitted.
It consists of 4 problems worth a total of 140 points and an extra-credit problem worth 35 points.
There are 18 pages in thi

Chapter 1
Datatypes
In pure first-order logic, term variables are assumed to range over all kinds of terms and their domains
are left unspecified. Hence we can restrict the domain of a term variable only indirectly by using a
predicate corresponding to a

Name:
Hemos ID:
CSE-433 Logic in Computer Science 2007
Quiz 1 Sample Solution
Problem 1 Problem 2
Total
Score
Max
1
30
70
100
Derivability and admissiblity [30 pts]
O even ZeroE
n odd
S n even SuccE
n even
SuccO
S n odd
Question 1. [6 pts]
n even
The rule

Name:
Hemos ID:
CSE-433 Logic in Computer Science 2007
Quiz 2 Sample Solution
Problem 1
Problem 2
Problem 3
Problem 4
Problem 5
Total
20
20
20
20
20
100
Score
Max
1
Interaction between connectives [20 pts]
Fill in the blank with a logically equivalent pro