lecture3 - CS245 - Winter 2010, Lecture 3 Shai Ben-David...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS245 - Winter 2010, Lecture 3 Shai Ben-David The language of propositional Calculus We no turn back to our main theme of developing formal languages for the analysis of logical implications (as well as other logical notions). The first step in the construction of a formal language is defining the set of expressions of that languages. These play a role similar to that played by words, or sentences, in natural languages. The expressions of the language of Propositional Calculus are called Proposi- tional Formulas . We define the set of propositional formulas using the structural induction tool that we have just introduced. We start by defining the underlying domain set (the set X , in the discussion of definitions by structural induction above). Let Σ = { lower-case English letters with and without subscript indices }∪{→ , ∨ , ∧ , ¬ , ) , ( } Σ is the set of ”letters” of our language. For any give set Σ, the set of all finite sequences of member of Σ is denoted by Σ * . • The domain set for the definition of propositions formulas is the set X = Σ * , where Σ is the set of characters defined above....
View Full 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 / 3

lecture3 - CS245 - Winter 2010, Lecture 3 Shai Ben-David...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online