2010_lecture7

# 2010_lecture7 - CS245 Winter 2010 Lecture 7 Shai Ben-David...

This preview shows pages 1–2. Sign up to view the full content.

CS245 - Winter 2010, Lecture 7 Shai Ben-David We have seen that a propositional formula can be viewed as a function from { T,F } n to { T,F } (where n is the number of propositional variables in the formula). Such functions, mapping vectors over a two-valued domain to two values, are called Boolean functions (one should note that it does not really mater how these values are denoted. Here we use the values { T,F } . In other contexts one encounters Boolean functions over { 0 , 1 } or {- 1 , 1 } ). Any Boolean function can be described by a table, listing all possible input vectors (as we have already mentioned, there are 2 n such vectors for a function over n Boolean variables) and the values the function outputs on each of these inputs. In our context, we call such tables ”truth tables”. A very natural question to ask is: can propositions express every possible Boolean function? In other words, given any truth table, does there exist a proposition that has it as its truth table. Theorem 1 (Post, 1921)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/11/2010 for the course ART AFM101 taught by Professor Mr.lushman during the Spring '10 term at University of Toronto.

### Page1 / 2

2010_lecture7 - CS245 Winter 2010 Lecture 7 Shai Ben-David...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online