1 / 39

Sentential logic

Sentential logic. Lecture based on:. Graeme Forbes, Modern Logic Katarzyna Paprzycka, online lectures. Sentential logic or propositional logic?. Logic is the most boring class Jane has ever taken. The most boring class Jane has ever taken is logic.

jaime-sandoval
Download Presentation

Sentential logic

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Sentential logic

  2. Lecture based on: • Graeme Forbes, Modern Logic • Katarzyna Paprzycka, online lectures

  3. Sentential logic or propositional logic?

  4. Logic is the most boring class Jane has ever taken. • The most boring class Jane has ever taken is logic.

  5. A sentence in the logical sense isonly an unambiguous declarative sentence. • it is either true or false. • (a) No exclamations are sentencesL. “Heyah!” “Come here!” • (b) No questions are sentencesL Are you bored already?

  6. (c) No ambiguous declarative sentences are sentencesL • (d) No declarative sentences with indexical expressions are sentencesL. • There is aclass of sentences containing the so-called “indexical” expressions (like ‘I’, ‘he’, ‘she’,‘there’, ‘now’, etc.) that are notoriously ambiguous because the indexical expressionschange their referent depending on the context in which they are uttered. • I am hungry now.

  7. NEGATION • Connective: It is not the case that • Symbol: ~ [the tilde] • Logical form: • ~p • Component: p – negated sentence

  8. CONJUNCTION • Connective: and • Symbol:  • Logical form: • p q • Components: p, q – conjuncts

  9. both ... and ... • ... as well as ... • ... but ... • ... however ... • ... though ... • ... although ... • ... even though ... • ... nevertheless … • ... still … • ... but still … • ... also … • ... while … • ... despite the fact that … • ... moreover … • ... in addition …

  10. DISJUNCTION • Connective: or • Symbol: ∨ [the wedge] • Logical form: • p ∨ q • Components: p, q – disjuncts

  11. either ... or ... • … or else …

  12. CONDITIONAL • Connective: if … then … • Symbol: → [the arrow] • Logical form: • p → q • Components: p – antecedent • q – consequent

  13. ... if ... • ... provided that ... • ... given that ... • ... in case ... • ... in the event that ... • ... as long as ... • ... assuming that ... • ... supposing that ... • ... on the condition that ... • ... on the assumption that ...

  14. BICONDITIONAL • Connective: if and only if • Symbol:  • Logical form: • p q • Components: p, q – terms of the biconditional; right and left hand sides

  15. ... if but only if... • … when and only when … • … just in case … • … iff … • … exactly if …

  16. Symbolization • Our currency will lose value. • Our currency will lose value and our trade deficit will narrow. • Either our currency will lose value, or exports will decrease and inflation will rise.

  17. John will attend the meeting but Mary will not. • Insider trading is unethical and illegal. • At least one of our two deficits, budget and trade, will rise. • Neither John nor Mary will attend the meeting. • John and Mary won’t both attend the meeting.

  18. If Smith bribes the instructor, then Smith will get an A.

  19. Smith will get an A if Smith bribes the instructor.

  20. Smith’s bribing the instructor is a sufficient condition for Smith to get an A.

  21. Smith will get an A only if Smith bribes the instructor. • Smith bribing the instructor is a necessary condition for Smith to get an A.

  22. Smith will get an A provided Smith bribes the instructor. • Smith will get an A whenever Smith bribes the instructor.

  23. Smith will fail unless he bribes the instructor.

  24. Your car will not start unless it has fuel in its tank.

  25. Smith will get an A if and only if Smith bribes the instructor. • Smith will get an A just in case Smith bribes the instructor.

  26. John will study hard and also bribe the instructor, and if he does both then he’ll get an A, provided the instructor likes him.

  27. If Smith bribes the instructor then he’ll get an A. And if he gets an A potential employers will be impressed and will make him offers. But Smith will receive no offers. Therefore Smith will not bribe the instructor.

  28. If logic is difficult, then few students will take logic courses unless such courses are obligatory. If logic is not difficult then logic courses will not be obligatory. So if a student can choose whether or not to take logic, then either logic is not difficult or few students take logic courses.

  29. If God exists, there will be no evil in the world unless God is unjust, or not omnipotent, or not omniscient. But if God exists the He is none of these, and there is evil in the world. So we have to conclude that God does not exist.

  30. SYNTAX • uninterpreted: the basic elements (apart from the connectives) do not have their own meaning • the basic elements are sentence-letters (not words) • The lexicon of LSL contains infinitely many sentence-letters

  31. A sentence-letter symbolizes an atomic sentence; stands for a fixed sentence • p, q – sentential variables, metavariables; do not stand for fixed sentences

  32. The lexicon of LSL: • All sentence-letters “A”, “B”, “C”, • Connectives • Punctuation marks “(“, “)” • Well-formed formula = grammatical formula (wff)

  33. Formation rules: conditionals: if it is given a wff or wffs as input, then such and such a wff results as an output

  34. Formation rules • Every sentence letter is a well formed formula (wff). • If pis a wff, so is p • If p and q are wffs, so is p  q • If p and q are wffs, so is p  q • If p and q are wffs, so is p  q • If p and q are wffs, so is p  q • Closure condition: nothing is a wff unless certified as such by the above rules

  35. mouse ”mouse” The object language – the metalanguage

  36. Use/mention distinction • Warsaw is the capital of Poland. use • “Warsaw” contains 6 letters. Mention • “Mouse” is an animal. • Mouse is a noun.

  37. Corner quotes = selective quotes – corner quotes around a whole expression put ordinary quotes selectively around parts of the expression, those parts which are object language symbols. • If p and q are wffs, so is “p  q” – incorrect • If p and q are wffs, the result of writing p followed by “” followed by q is a wff.

  38. SEMANTICS • If a sentence is true then it is said to have the truth-value true • The Principle of Bivalence: there are exactly two truth-values, truth and false. Every meaningful sentence, simple or compound, has one or the other, but not both, of these truth-values.

  39. Any sentential connective whose meaning can be captured in a truth-table is called a truth-functional connective and is said to express a truth-function.

More Related