Introducing Sentential Logic (SL) Part II Semantics
|
|
- Marian Berry
- 7 years ago
- Views:
Transcription
1 Introducing Sentential Logic (SL) Part II Semantics 1. Our refined understanding of entailment invokes the notion of an interpretation. For notions of entailment that center on truth, the purpose of an interpretation is to provide stable and unique assignments of truth values to the various sentences that can participate in sequent expressions. The idea is that we use interpretations to assign either the value true or the value false (but not both!) to each and every sentence of a formal language. The truth and falsity of a sentence is thus relative to an interpretation. 2. In what is called classical logic, we assume that each and every sentence will take on exactly one of the following two truth values: True (T) or False (F). There are non-classical truth-functional logics as well, in which other truth-values are introduced, or in which some sentences may be assigned neither of the classical truth values, or even more than one truth-value (for instance, in epistemic logic some sentences may be assigned the value B standing for both true and false). There are also semantics that don t employ the notion of a truth-function at all, but instead work with other kinds of primitives (for example, incompatibility semantics). At this stage in the game, we will simply be working with a semantics of the plain-ole vanilla classical type. 3. Basic Properties of = From the idea that interpretations provide stable and unique assignments of truth values, we may already stipulate the following basic structural principles of entailment: Assumptions: For any sentence φ, φ = φ. That is, any sentence entails itself. Thinning (or Persistence): If Γ =φ, then Γ,ψ =φ. Basically, this principle tells us that adding any sentence (or set of sentences) as premises to a valid entailment will not affect its validity. Cutting: If Γ =φ and φ,δ =ψ, then Γ,Δ =ψ Essentially, this principle captures the transitivity of entailment: If some formula is a consequence of some premises and in turn that formula (along with some other possible premises) entails some further formula, then that original set of premises (in concert with the other supporting premises) will entail that further formula, without explicit mention of formula originally entailed. The semantics of SL 4. We now turn specifically to sentences in our logical language SL. SL is what is called wholly truthfunctional. That means that in giving it an interpretation, all we need to do is to supply truth values for the various capital letters or atomic wffs. The truth-values of compound wffs are then completely determined from the truth-values of simpler (less compound) wffs - indeed, those which compose that very compound wff. That is, the semantics of SL is not just recursive; it is also compositional. 5. You might well already know how to compute the truth values of compound wffs in SL. The operators stand for various familiar truth-functions. A function is simply a mapping from inputs (or
2 arguments) to outputs (or values). Specifically, an n-place function goes from ordered n-tuples of objects from one domain to objects of another domain (which might be one and the same). An n-place truth function is thus one that takes n-tuples of truth values as inputs and spits out specific truth values as outputs. Individual truth functions are easily represented by means of truth tables. Here, for instance, is a representation of the 3-place truth function (which we can call %) that takes the value F just in case its first argument is T, and there is at least one other T among its other two operators: φ χ Ψ %( φ, χ, ψ) T T T F T T F F T F T F T F F T F T T T F T F T F F T T F F F T In this table, the columns underneath the three stand-alone Greek letters systematically list the various permutations of truth-values that the arguments (or inputs) of a three-place truth function may take. For example, the 5 th row of the entire table (which is the 4 th row underneath the initial one), represents a condition in which the first argument is T, while the second and third arguments are F. There are 8 distinct permutations of truth values that these three arguments may take, hence 8 rows underneath the initial row. The column of cells underneath the % then display the specific truth value that the % function takes whenever its 3 arguments (or inputs) take on the specific truth values listed to the left of that cell. 6. By convention, the tilde in SL is a one-place operator that represents the negation function. Whenever the sentence it operates on (or prefixes) is true, then it is false, and vice-versa. Here, then, is its truth table representation: φ ~φ T F F T These specific functions of the ampersand, wedge, and arrow are easily illustrated by means of the following truth tables: φ ψ (φ&ψ) (φvψ) (φ ψ) T T T T T T F F T F F T F T T F F F F T
3 We say then that the ampersand stands for the two-place conjunction function: it is true just in case both of its arguments (or conjuncts) are true, and false if either of them (or both) are false. The wedge stands for the disjunction function: it is false just in case both of its arguments (or disjuncts) are false, and true if either (or both) are true. The arrow signifies the material conditional: it is false just in case its first argument (the antecedent) is true and its second argument (or consequent) is false, and it is true just in case either its antecedent is false or its consequent is true. You will need to commit these rules to memory. The ampersand thus bears some resemblance to (some uses of) the English word and, while the wedge functions roughly like some uses of the English word or (specifically those in which the or is used in an inclusive sense). While it is sometimes claimed that the arrow corresponds to the English if.. then, this correspondence is tenuous at best. It is better to leave the arrow as it is, and not to claim that it is anything remotely equivalent to the conditional in English. 7. There is a different truth function for each distinct way one can fill out the column of a truth table. That means that there are 16 distinct two-place truth functions (for each of the 4 cells in the column, one can have either a T or an F; 2 4 =16. Other operators may be devised to stand for other truth functions (i.e. the biconditional, or the n/and and n/or operations illustrated below). Indeed, there are many, many truth functions that simply go nameless, especially those with more than 2 arguments. φ ψ (φ ψ) (φ ψ) (φ ψ) T T T F F T F F T F F T F T F F F T T T 8. The truth-functionality of SL also allows for another nice feature: the substitution of equivalent formulas. If two formulas are logically equivalent to one another (they take on the same truth value in every possible situation), then one may freely substitute an appearance of one with the other inside any compound formula of SL to form another formula logical equivalent to that compound. 9. Truth functions may operate upon the outputs of other truth functions. That is what happens with compound or complex formulas. Such compounds can serve to express yet more complex truth functions. Here, for instance, are truth table representations of progressively compound sentence of SL: φ χ ψ ( χ v ψ) (φ&( χ v ψ)) ~ (φ&( χ v ψ)) T T T T T F T T F T T F T F T T T F T F F F F T F T T T F T
4 F T F T F T F F T T F T F F F F F T In this table, the fourth column here represents the disjunction of the second and third columns. The fifth column displays the conjunction of the first and fourth columns. Finally, the fifth column is the negation of the fourth. Notice how this column matches precisely the column above for %. We can thus say that the formula ~ (φ&( χ v ψ)) expresses the very same truth function as %. 10. Truth tables also enable us to put our unpacking of sequent expressions to work. Suppose that we wish to evaluate the following sequent: (P Q), (~Q ~R), (~P R) = Q. What we do is we set up a truth table that jointly displays the truth values of all of these formulas under every permutation of truth and falsity of their component atomic sentence letters. We begin by listing all of the sequent expression s component atomic sentences along the left of the first row, followed by all of the formulas on the left of the double turnstile, and then the formula(s) on the right: P Q R (P Q) (~Q ~R) (~P R) Q We then fill in the columns underneath the component atomics in a way that captures all of the various combinations of truth and falsity these atomics can take. These are typically called a truth table s base columns. One can most easily and systematically accomplish this task by starting at the right-most base column and alternate between truth and falsity as one goes down the column. Then as we shift to the next column on the left, we double the period of alternation (1T followed by 1F, then 2T s by 2F s, 4T s by 4F s, and so on). In this case, the result will look as follows: P Q R (P Q) (~Q ~R) (~P R) Q T T T T T F T F T T F F F T T F T F F F T
5 F F F Note that when there are n component atomics in a sequent, there will be 2 n rows underneath the first in its corresponding truth table representation. Each of these rows will correspond to a distinct possible interpretation of those atomic sentences. The fifth row (underneath the first), for example, represents the interpretation in which P is assigned the truth value of False, while Q and R are both assigned the truth value of True. We then fill out the columns underneath the other formulas according to the truth values that they would take according to the assignments of truth values indicated in that row: P Q R (P Q) (~Q ~R) (~P R) Q T T T T T T T T T F T T T T T F T F F T F T F F F T T F F T T T T T T F T F T T F T F F T T F T F F F F T T F F We are now in a position to put our understanding of sequent expressions to work. Recall that the double turnstile tells us that there are no interpretations in which every sentence on the left is true and some sentence (perhaps the only sentence) on the right is false. Is this correct in this case? What we are looking for is a row in the above truth table for which the cells underneath the formulas on the left of the original sequent are all true, and for which the cell (or some cells) underneath the formula(s) on the right is false. Looking underneath the columns of the formulas on the left, we can see that there are three rows in which all of those formulas are true (the first, second, and fifth rows beneath the top). But in each of these rows, the truth value of formula on the right of the double turnstile (represented in the final column) turns out also to be true. Hence there are no rows (or interpretations) in which all of the formulas on the left of the double turnstile are true and the formula on the right is false. The sequent expression is thus correct! 11. Now in some circumstances, we can argue for the correctness or incorrectness of a certain sequent expression in an informal, but nevertheless rigorous fashion in more or less natural language. Consider once more the example above. We are wondering whether there could be any interpretations that make (P Q), (~Q ~R), and (~P R) all true and Q false. Now for Q to be false and (P Q) to be true, P would have to false as well. Similarly, for Q to be false and (~Q ~R) to be true, ~R would have to true (why?), and thus R would have to be false. But if both P and R have to be false, then (~P R) would also have to be false. And so there is no way in which one can make Q false and also (P Q), (~Q ~R), and (~P R) all true. Hence we can say once again that the sequent in question is correct. 12. To take another example, here s a truth table representation for evaluating the following sequent: ~(A B), (~BvC), ~C = (A C). A B C ~(A B) (~BvC) ~C (A C) T T T F T F T T T F F F T T T F T T T F F
6 T F F T T T F F T T F T F T F T F F F T T F F T F T F F F F F F T T F Now look at the fourth row following the top (the one corresponding to a truth-value assignment of True to A and False to both B and C). Note that on this assignment of truth values all of the formulas on the left of the double turnstile are true, and the formula on the right of the double turnstile is false. Hence we do have an interpretation in which everything on the left is true and something on the right is false. This interpretation is called a counterexample to the sequent, which thereby demonstrates its incorrectness. Hence we may write ~(A B), (~BvC), ~C (A C). 13. In conclusion, the take-home message is this: an interpretation in SL consists of 1) an assignment of truth values to the various capital letters plus an assignment of an n-place truth-function to each n-place operator (usually the various operators will be given the interpretation that they are conventionally understood to symbolize). That way, one can use an interpretation to calculate the truth values of all the sentences of S.L., which we can in turn use to evaluate the correctness of sequent expressions. COMMIT THIS TO MEMORY!! 14. Exercises 1. Write out truth tables representing the following truth functions: (a) The three-place function which takes the value T just in case (j.i.c.) exactly one of its arguments or sentential inputs takes the value T (b) The three-place function which takes the value T j.i.c. at least two of its arguments take the value T. (c) The three-place function that takes the value F j.i.c. its second argument takes the value T. (d) The three-place function that takes the value F j.i.c its first argument is T and the second and third arguments have opposite truth values. 2. For each of the truth functions specified above, find a formula in SL (using the standard operators) that expresses it. 3. How many total three-place truth functions are there? (Though you don t need to list them all, it would be nice for you to give some sense of how you arrived at your answer.) 4. Use the truth table method to determine whether the following sequents are correct: (a) ~(P Q) = (P ~Q)
7 (b) (P&~Q) v (~P&Q) = (P v ~Q) (c) ~(P P) = (d) ((P&Q) & (~P&~Q)) = (e) = ((P&Q) v ~Q) (f) = ((P Q) v (R P)) (g) ((Q v R) P) = = ((Q P) v (R P)) [Think of = = as asserting that the entailment goes both ways. That means you ll have to provide separate determinations for each direction.] 5. Without using a truth table, determine whether the following sequents are correct. Be sure to indicate your reasoning. (a) (P Q), (Q R), (R S) = (P S) (b) (PvQ), ~(P&R), ~(Q&S) = ~(R&S) (c) (P (QvR)), (R (P S)), ~(S&P) = (P Q) (d) (P (QvR)), (R (P S)), ~(S&P) = (Q P) 6. Show why the following basic principles of the standard operators hold: (a) The basic property of Negation NEG: Г =φ just in case Г (or if and only if) Г,~φ =. (b) The basic property of Conjunction CONJ: Г = (φ & ψ) just in case Г = φ and Г = ψ. (c) The basic property of Disjunction DISJ: Г, (φ v ψ) = just in case (or if and only if) Г, φ = and Г, ψ =. (d) The basic property of the Material Conditional COND: Г = (φ ψ) just in case Г,φ = ψ
Likewise, we have contradictions: formulas that can only be false, e.g. (p p).
CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula
More informationCHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationdef: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
More information24. PARAPHRASING COMPLEX STATEMENTS
Chapter 4: Translations in Sentential Logic 125 24. PARAPHRASING COMPLEX STATEMENTS As noted earlier, compound statements may be built up from statements which are themselves compound statements. There
More informationQuine on truth by convention
Quine on truth by convention March 8, 2005 1 Linguistic explanations of necessity and the a priori.............. 1 2 Relative and absolute truth by definition.................... 2 3 Is logic true by convention?...........................
More informationInvalidity in Predicate Logic
Invalidity in Predicate Logic So far we ve got a method for establishing that a predicate logic argument is valid: do a derivation. But we ve got no method for establishing invalidity. In propositional
More informationSolutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1
Solutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1 Prof S Bringsjord 0317161200NY Contents I Problems 1 II Solutions 3 Solution to Q1 3 Solutions to Q3 4 Solutions to Q4.(a) (i) 4 Solution to Q4.(a)........................................
More information5.1 Radical Notation and Rational Exponents
Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots
More informationChapter 11 Number Theory
Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications
More informationRegular Expressions and Automata using Haskell
Regular Expressions and Automata using Haskell Simon Thompson Computing Laboratory University of Kent at Canterbury January 2000 Contents 1 Introduction 2 2 Regular Expressions 2 3 Matching regular expressions
More information5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1
MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing
More informationDegrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets.
Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets. Logic is the study of reasoning. A language of propositions is fundamental to this study as well as true
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationMath 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More informationThe Refutation of Relativism
The Refutation of Relativism There are many different versions of relativism: ethical relativism conceptual relativism, and epistemic relativism are three. In this paper, I will be concerned with only
More informationSlippery Slopes and Vagueness
Slippery Slopes and Vagueness Slippery slope reasoning, typically taken as a fallacy. But what goes wrong? Is it always bad reasoning? How should we respond to a slippery slope argument and/or guard against
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
Propositional Logic: logical operators Negation ( ) Conjunction ( ) Disjunction ( ). Exclusive or ( ) Conditional statement ( ) Bi-conditional statement ( ): Let p and q be propositions. The biconditional
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More information1.6 The Order of Operations
1.6 The Order of Operations Contents: Operations Grouping Symbols The Order of Operations Exponents and Negative Numbers Negative Square Roots Square Root of a Negative Number Order of Operations and Negative
More informationP1. All of the students will understand validity P2. You are one of the students -------------------- C. You will understand validity
Validity Philosophy 130 O Rourke I. The Data A. Here are examples of arguments that are valid: P1. If I am in my office, my lights are on P2. I am in my office C. My lights are on P1. He is either in class
More informationPart 1 Expressions, Equations, and Inequalities: Simplifying and Solving
Section 7 Algebraic Manipulations and Solving Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving Before launching into the mathematics, let s take a moment to talk about the words
More informationLogic in general. Inference rules and theorem proving
Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent
More informationLogic Appendix. Section 1 Truth Tables CONJUNCTION EXAMPLE 1
Logic Appendix T F F T Section 1 Truth Tables Recall that a statement is a group of words or symbols that can be classified collectively as true or false. The claim 5 7 12 is a true statement, whereas
More informationArguments and Dialogues
ONE Arguments and Dialogues The three goals of critical argumentation are to identify, analyze, and evaluate arguments. The term argument is used in a special sense, referring to the giving of reasons
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More information6 3 4 9 = 6 10 + 3 10 + 4 10 + 9 10
Lesson The Binary Number System. Why Binary? The number system that you are familiar with, that you use every day, is the decimal number system, also commonly referred to as the base- system. When you
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More informationNP-Completeness and Cook s Theorem
NP-Completeness and Cook s Theorem Lecture notes for COM3412 Logic and Computation 15th January 2002 1 NP decision problems The decision problem D L for a formal language L Σ is the computational task:
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More informationBeyond Propositional Logic Lukasiewicz s System
Beyond Propositional Logic Lukasiewicz s System Consider the following set of truth tables: 1 0 0 1 # # 1 0 # 1 1 0 # 0 0 0 0 # # 0 # 1 0 # 1 1 1 1 0 1 0 # # 1 # # 1 0 # 1 1 0 # 0 1 1 1 # 1 # 1 Brandon
More informationManagerial Economics Prof. Trupti Mishra S.J.M. School of Management Indian Institute of Technology, Bombay. Lecture - 13 Consumer Behaviour (Contd )
(Refer Slide Time: 00:28) Managerial Economics Prof. Trupti Mishra S.J.M. School of Management Indian Institute of Technology, Bombay Lecture - 13 Consumer Behaviour (Contd ) We will continue our discussion
More informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More informationCorrespondence analysis for strong three-valued logic
Correspondence analysis for strong three-valued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K 3 ).
More informationLinear Programming Notes VII Sensitivity Analysis
Linear Programming Notes VII Sensitivity Analysis 1 Introduction When you use a mathematical model to describe reality you must make approximations. The world is more complicated than the kinds of optimization
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More information(Refer Slide Time: 2:03)
Control Engineering Prof. Madan Gopal Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 11 Models of Industrial Control Devices and Systems (Contd.) Last time we were
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More informationTRANSLATIONS IN SENTENTIAL LOGIC
TRANSLATIONS IN SENTENTIAL LOGIC 1. Introduction...100 2. The Grammar Of Sentential Logic; A Review...101 3. Conjunctions...102 4. Disguised Conjunctions...103 5. The Relational Use Of And...104 6. Connective-Uses
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationCS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15-cs510-se
More information3. Logical Reasoning in Mathematics
3. Logical Reasoning in Mathematics Many state standards emphasize the importance of reasoning. We agree disciplined mathematical reasoning is crucial to understanding and to properly using mathematics.
More informationCS 3719 (Theory of Computation and Algorithms) Lecture 4
CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a
More informationArchitecture Artifacts Vs Application Development Artifacts
Architecture Artifacts Vs Application Development Artifacts By John A. Zachman Copyright 2000 Zachman International All of a sudden, I have been encountering a lot of confusion between Enterprise Architecture
More informationCALCULATIONS & STATISTICS
CALCULATIONS & STATISTICS CALCULATION OF SCORES Conversion of 1-5 scale to 0-100 scores When you look at your report, you will notice that the scores are reported on a 0-100 scale, even though respondents
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationMathematics Cognitive Domains Framework: TIMSS 2003 Developmental Project Fourth and Eighth Grades
Appendix A Mathematics Cognitive Domains Framework: TIMSS 2003 Developmental Project Fourth and Eighth Grades To respond correctly to TIMSS test items, students need to be familiar with the mathematics
More informationCosmological Arguments for the Existence of God S. Clarke
Cosmological Arguments for the Existence of God S. Clarke [Modified Fall 2009] 1. Large class of arguments. Sometimes they get very complex, as in Clarke s argument, but the basic idea is simple. Lets
More information6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
More informationThe epistemic structure of de Finetti s betting problem
The epistemic structure of de Finetti s betting problem Tommaso Flaminio 1 and Hykel Hosni 2 1 IIIA - CSIC Campus de la Univ. Autònoma de Barcelona s/n 08193 Bellaterra, Spain. Email: tommaso@iiia.csic.es
More informationProbability Distributions
CHAPTER 5 Probability Distributions CHAPTER OUTLINE 5.1 Probability Distribution of a Discrete Random Variable 5.2 Mean and Standard Deviation of a Probability Distribution 5.3 The Binomial Distribution
More information1/9. Locke 1: Critique of Innate Ideas
1/9 Locke 1: Critique of Innate Ideas This week we are going to begin looking at a new area by turning our attention to the work of John Locke, who is probably the most famous English philosopher of all
More informationNUMBER SYSTEMS APPENDIX D. You will learn about the following in this appendix:
APPENDIX D NUMBER SYSTEMS You will learn about the following in this appendix: The four important number systems in computing binary, octal, decimal, and hexadecimal. A number system converter program
More informationCS311 Lecture: Sequential Circuits
CS311 Lecture: Sequential Circuits Last revised 8/15/2007 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationProblem of the Month: Fair Games
Problem of the Month: The Problems of the Month (POM) are used in a variety of ways to promote problem solving and to foster the first standard of mathematical practice from the Common Core State Standards:
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More information7 Relations and Functions
7 Relations and Functions In this section, we introduce the concept of relations and functions. Relations A relation R from a set A to a set B is a set of ordered pairs (a, b), where a is a member of A,
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationSample Questions with Explanations for LSAT India
Five Sample Analytical Reasoning Questions and Explanations Directions: Each group of questions in this section is based on a set of conditions. In answering some of the questions, it may be useful to
More informationWhat Is Singapore Math?
What Is Singapore Math? You may be wondering what Singapore Math is all about, and with good reason. This is a totally new kind of math for you and your child. What you may not know is that Singapore has
More informationAP: LAB 8: THE CHI-SQUARE TEST. Probability, Random Chance, and Genetics
Ms. Foglia Date AP: LAB 8: THE CHI-SQUARE TEST Probability, Random Chance, and Genetics Why do we study random chance and probability at the beginning of a unit on genetics? Genetics is the study of inheritance,
More informationBook Review of Rosenhouse, The Monty Hall Problem. Leslie Burkholder 1
Book Review of Rosenhouse, The Monty Hall Problem Leslie Burkholder 1 The Monty Hall Problem, Jason Rosenhouse, New York, Oxford University Press, 2009, xii, 195 pp, US $24.95, ISBN 978-0-19-5#6789-8 (Source
More informationPropositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.
irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto
More informationRegions in a circle. 7 points 57 regions
Regions in a circle 1 point 1 region points regions 3 points 4 regions 4 points 8 regions 5 points 16 regions The question is, what is the next picture? How many regions will 6 points give? There's an
More information2.1 Increasing, Decreasing, and Piecewise Functions; Applications
2.1 Increasing, Decreasing, and Piecewise Functions; Applications Graph functions, looking for intervals on which the function is increasing, decreasing, or constant, and estimate relative maxima and minima.
More informationBase Conversion written by Cathy Saxton
Base Conversion written by Cathy Saxton 1. Base 10 In base 10, the digits, from right to left, specify the 1 s, 10 s, 100 s, 1000 s, etc. These are powers of 10 (10 x ): 10 0 = 1, 10 1 = 10, 10 2 = 100,
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationExcel: Introduction to Formulas
Excel: Introduction to Formulas Table of Contents Formulas Arithmetic & Comparison Operators... 2 Text Concatenation... 2 Operator Precedence... 2 UPPER, LOWER, PROPER and TRIM... 3 & (Ampersand)... 4
More informationKant s deontological ethics
Michael Lacewing Kant s deontological ethics DEONTOLOGY Deontologists believe that morality is a matter of duty. We have moral duties to do things which it is right to do and moral duties not to do things
More information1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:
Exercises 1 - number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b) - 435 2. For each of
More informationSYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections
More information[Refer Slide Time: 05:10]
Principles of Programming Languages Prof: S. Arun Kumar Department of Computer Science and Engineering Indian Institute of Technology Delhi Lecture no 7 Lecture Title: Syntactic Classes Welcome to lecture
More informationStatistical tests for SPSS
Statistical tests for SPSS Paolo Coletti A.Y. 2010/11 Free University of Bolzano Bozen Premise This book is a very quick, rough and fast description of statistical tests and their usage. It is explicitly
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
More informationBasic Set Theory. 1. Motivation. Fido Sue. Fred Aristotle Bob. LX 502 - Semantics I September 11, 2008
Basic Set Theory LX 502 - Semantics I September 11, 2008 1. Motivation When you start reading these notes, the first thing you should be asking yourselves is What is Set Theory and why is it relevant?
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,
More information25 Integers: Addition and Subtraction
25 Integers: Addition and Subtraction Whole numbers and their operations were developed as a direct result of people s need to count. But nowadays many quantitative needs aside from counting require numbers
More information9. Momentum and Collisions in One Dimension*
9. Momentum and Collisions in One Dimension* The motion of objects in collision is difficult to analyze with force concepts or conservation of energy alone. When two objects collide, Newton s third law
More informationIAI : Expert Systems
IAI : Expert Systems John A. Bullinaria, 2005 1. What is an Expert System? 2. The Architecture of Expert Systems 3. Knowledge Acquisition 4. Representing the Knowledge 5. The Inference Engine 6. The Rete-Algorithm
More informationBetting on Fuzzy and Many-valued Propositions
Betting on Fuzzy and Many-valued Propositions Peter Milne 1 Introduction In a 1968 article, Probability Measures of Fuzzy Events, Lotfi Zadeh proposed accounts of absolute and conditional probability for
More information2. The Language of First-order Logic
2. The Language of First-order Logic KR & R Brachman & Levesque 2005 17 Declarative language Before building system before there can be learning, reasoning, planning, explanation... need to be able to
More informationDIFFICULTIES AND SOME PROBLEMS IN TRANSLATING LEGAL DOCUMENTS
DIFFICULTIES AND SOME PROBLEMS IN TRANSLATING LEGAL DOCUMENTS Ivanka Sakareva Translation of legal documents bears its own inherent difficulties. First we should note that this type of translation is burdened
More informationBasic Logic Gates Richard E. Haskell
BASIC LOGIC GATES 1 E Basic Logic Gates Richard E. Haskell All digital systems are made from a few basic digital circuits that we call logic gates. These circuits perform the basic logic functions that
More informationIB Math Research Problem
Vincent Chu Block F IB Math Research Problem The product of all factors of 2000 can be found using several methods. One of the methods I employed in the beginning is a primitive one I wrote a computer
More information3.Basic Gate Combinations
3.Basic Gate Combinations 3.1 TTL NAND Gate In logic circuits transistors play the role of switches. For those in the TTL gate the conducting state (on) occurs when the baseemmiter signal is high, and
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationToothpick Squares: An Introduction to Formulas
Unit IX Activity 1 Toothpick Squares: An Introduction to Formulas O V E R V I E W Rows of squares are formed with toothpicks. The relationship between the number of squares in a row and the number of toothpicks
More informationDISCRETE MATH: LECTURE 3
DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false
More informationLecture Notes on Linear Search
Lecture Notes on Linear Search 15-122: Principles of Imperative Computation Frank Pfenning Lecture 5 January 29, 2013 1 Introduction One of the fundamental and recurring problems in computer science is
More informationThe theory of the six stages of learning with integers (Published in Mathematics in Schools, Volume 29, Number 2, March 2000) Stage 1
The theory of the six stages of learning with integers (Published in Mathematics in Schools, Volume 29, Number 2, March 2000) Stage 1 Free interaction In the case of the study of integers, this first stage
More informationVieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
More informationGates, Circuits, and Boolean Algebra
Gates, Circuits, and Boolean Algebra Computers and Electricity A gate is a device that performs a basic operation on electrical signals Gates are combined into circuits to perform more complicated tasks
More information