Undecidability and Incompleteness 80-311
Homework #5 (a final) on Decidability and Completeness
Your answers for this final assignment are due in 8 days, by Friday, May 4.
If, without penalty, you wan
Undecidability and Incompleteness 80-311
Homework #3 Mid-term assignment
Your answers for this assignment are due by class time, 3:00, Tuesday, March 20, 2012.
On the Ackermann functions. This assignm
Adequate set of connectives
A remarkable property of the standard set of connectives (, , , , ) is the fact that for every table p q . 1 1 . * * * 0 0 . * there is a formula (depending on the variabl
3
Expressive Adequacy
A truth-function of n arguments is a function whose domain is the set of
all n-tuples (sequences of length n) of truth-values, and whose range is the
set of truth-values, cfw_1,
Undecidability and Incompleteness 80-311
Homework #2 More Logic
Your answers for this assignment are due by class time, 3:00, Thursday, February 23, 2012.
Whether soundness and completeness holds for
Notes on an axiomatic system for Propositional Logic
Background: The pair cfw_, is expressively complete for propositional truth functions. So, we explore a (syntactic) proof system
for wff that use o
Jonathan Chen
80311 HW5
On Searle vs. Dennett
The argument to be put under analytical scrutiny against Searles stance comes from Daniel
Dennett in his commentary titled The milk of human intentionalit
Undecidability and Incompleteness 80-311
Homework #4 on the Turing-Searle debate over Strong AI
Your essay for this assignment is due by class time, 3:00, Tuesday, April 17, 2012.
For this homework as
Undecidability and Incompleteness 80-311
Homework #1 On Propositional Logic
Your answers for this assignment are due by class time, 3:00, Tuesday, February 7, 2012.
1.
2.
3.
General Instructions for c