Transcription of Module 1: Basic Logic Theme 1: Propositions
{{id}} {{{paragraph}}}
Example: barber
Module 1: Basic Logic Theme 1: Propositions
Module 1: Basic LogicTheme 1: PropositionsEnglish sentences are either true or false or neither. Consider the following sentences:1. Warsaw is the capital of +5= How are you?The first sentence is true, the second is false, while the last one is neither true nor false. A statementthat is eithertrueorfalsebut not both is called aproposition. Propositional Logic deals with suchstatements andcompound propositionsthat combine together simple Propositions ( , combiningsentences (1) and (2) above we may say Warsaw is the capital of Poland and2+5=3 ).In order to build compound Propositions we need rules on how to combine Propositions . Wedenote Propositions by lowercase lettersp,qorr. Let us define: Theconjunctionofpandq, denoted asp^q, is the propositionpandq;and it istruewhen bothpandqare true and false otherwise. Thedisjunctionofpandq, denoted asp_q, is the propositionporq;and it isfalsewhen bothpandqare false and true otherwise. Thenegationofp, denoted either as:por p, is the propositionIt is 1:Letp= Hawks swoop andq= Gulls glide.
Theme 4: Predicates and Quantifiers In mathematics we often have to deal with sentences like p: x 2 2 +1 = 0 or q n is a prime number; which are not propositions since their values are neither true nor false since the values of the variables x and n are not specified. We shall denote such statements as P or Q and call propositional functions ...
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: