LPS 29 Lecture Notes - Lecture 4: Propositional Calculus, Wnew-Fm, Logical Form

62 views4 pages

Document Summary

Lps 29 - lecture 3 propositional logic. Language of propositional logic: language consisting of symbolic notation. Formalization turns a word sentence into a sentence or argument form. Formalization of a simple sentence: today is cold. (p, today is not cold. (~p) Formalization of sentences with several logical operators: example 1: today is not both very hot (p) and very cold (q) Note: brackets are needed in this case because ~ acts as a negative sign, and only applied to the sentence letter it is attached to. Note: brackets must specify which sentence letters fit together to properly reflect the meaning of the sentence. Review: vocabulary of language of propositional logic: & s: sentence letters: capital letters that represent a specific sentence/part of a sentence. Can contain numerical subscripts: logical operators: ~, &, v, , , brackets: (,) Sentence letters are nonlogical symbols because they can represent different sentences.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents