This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Pf : BY CONTRADICTION. (See notes.) Def : A computational problem is a specification of two sets A and U, such that A is a subset of U. We say a computational problem is decidable if there exists a finitely describable computer program (M) or an algorithm such that for all x U, M(x) = {yes if x A, no if x is not in A) Example (See notes.) Theorem : Propositional logic is decidable. Def : Let S Sent PL . S = number of symbols in S. Question: How many steps does the truth table test for tautology take as a function of S. Answer: Take 2 ^ (1/3) S Conjecture: For every n N (natural numbers) there exist sentences S Sent PL such that the shortest proof of S (Say in F T ) is 2 ^ R S, R > 0. Claim: (See notes.)...
View
Full
Document
This note was uploaded on 04/07/2008 for the course PHILOSOPHY 407 taught by Professor Dean during the Spring '08 term at Rutgers.
 Spring '08
 Dean

Click to edit the document details