LIN1032 Formal Foundations for Linguistics
|
|
- Marian Boyd
- 6 years ago
- Views:
Transcription
1 LIN1032 Formal Foundations for Lecture 1 Albert Gatt
2 Practical stuff Course tutors: Albert Gatt (first half) Ray Fabri (second half) Course website: TBA
3 Practical stuff Suggested course text: J. Allwood, L-G Andersson, O. Dahl (1977). Logic in. Cambridge University Press Assessment: end of semester test Structure of lectures: a lot of practical work, in addition to explanation!
4 The subject matter In many areas of linguistics, we use mathematical techniques. Some examples: trees in syntactic description the use of logic in analysing the meaning of sentences the use of sets to define the things denoted by a word
5 What is Mathematics, really? It s not just about numbers! Mathematics is much more than that: Mathematics is, most generally, the study of any and all certain truths (about any kind of concepts) These concepts can be about numbers, symbols, ideas, images, sounds, anything!
6 So, what s this class about? Our focus is on discrete mathematical structures Discrete ( discreet!) Composed of distinct, separable parts. Opposite of continuous. Structures Objects built up from simpler objects. Discrete Mathematics The mathematical study of discrete objects and structures.
7 Uses of Discrete Math Starting from simple structures of logic and set theory, theories are constructed that capture aspects of reality: Physics Biology (DNA) Common-sense reasoning (logic) Natural Language (trees, sets, functions,..) Anything that we want to describe precisely
8 Aims of the course This course aims to introduce some of the discrete mathematical methods which are useful in various areas of linguistics. The aim is introductory. We are not interested in becoming mathematicians, but in becoming informed consumers of certain of these techniques.
9 Course contents Five main parts: 1. Set theory 2. Propositional logic 3. Predicate logic 4. Trees and graphs 5. Feature structures
10 Course contents Five main parts: 1. Set theory we ll start here 2. Propositional logic 3. Predicate logic 4. Trees and graphs 5. Feature structures
11 Part 1 The concept of a set
12 Introduction to Set Theory A set is a type of structure, representing an unordered collection of zero or more distinct objects. sometimes referred to as a collection or an aggregate Set theory deals with operations between, relations among, and statements about sets.
13 The concept of a set You can define a set of anything. The members of a set do not need to have something in common. We re usually interested in sets whose members do have some meaningful relationship
14 Why sets? Possibly the most fundamental mathematical structure: All of mathematics can be defined in terms of some form of set theory. More important for us: set theory is used in much of formal semantics e.g. we can take the meaning of the word dog to be a certain set of things e.g. the meaning of love can be characterised as a relation between members of two sets many other structures, such as trees, can be defined in terms of sets
15 Some examples of sets the set of all winners of the Nobel Prize for Literature = {William Faulkner, Albert Camus, Gabriel Garcia Marquez, } this set is finite the set of all the positive integers = {1, 2, 3, 4, } this set is infinite the set of all students
16 Intuition behind sets Almost anything you can do with individual objects, you can also do with sets of objects. E.g. (informally speaking), you can refer to them, compare them, combine them, You can also do some things to a set that you probably cannot do to an individual: E.g., you can check whether one set is contained in another determine how many elements it has
17 Venn diagrams for representing sets donkey girl sky house ship shape rat robber river red ripping rode the set of all English nouns these sets have something in common the set of English words beginning with r
18 Exercise 1 Assume we have a small universe consisting of: Lidwina, who studies and Mathematics Steve, who studies Mathematics êensu, who studies Philosophy, Mathematics and Stephanie, who studies Olga, who studies Philosophy Draw a Venn diagram to represent these students according to the courses they study.
19 Exercise 1 Mathematics Stephanie Lidwina Steve êensu Philosophy Olga
20 Exercise 1 (continued) Indicate, by shading the right parts of the Venn diagram, all the parts which consist of students who study only, or Philosophy only, or both and Philosophy but not Mathematics
21 Exercise 1 Mathematics Stephanie Lidwina Steve êensu Philosophy Olga These parts do not belong to the shaded area
22 Basic notation for sets Venn Diagrams are useful, but sometimes a bit cumbersome. For sets, we ll use variables S, T, U, by convention, set variables are in uppercase
23 Defining a set I We can define a set by enumeration i.e. by listing all its elements or members by convention, we use curly brackets {} L L = {Stephanie, Lidwina, êensu} Stephanie Lidwina êensu
24 Defining a set II Another way of defining a set is by description L Stephanie Lidwina êensu L = {x x is a student of } In English: L is the set of all those x, such that x is a student of. NB: In this notation, we use lowercase x to denote a variable. In our notation, x ranges over students of.
25 Definition by description Defining a set by description is much more flexible than by enumeration. We can even define an infinite set N = {x x is a natural number} By enumeration: N = {0, 1, 2, 3, 4, 5 }
26 Exercise 2 Define the set of integers (whole numbers) between 1 and 5 by enumeration. {1,2,3,4,5} Define the following by description: the set of all things which are red {x x is red} the set of all women with a moustache {x x is a woman and x has a moustache} the set of all men who are bald {x x is a man and x is bald} Be as explicit as possible: better x is a man and x is bald than x is a bald man
27 Basic properties of sets Sets are inherently unordered: No matter what objects a, b, and c denote, {a, b, c} = {a, c, b} = {b, a, c} = Multiple listings make no difference: {a, a, c, c, c, c}={a,c} This is why our definition stated that a set is an unordered collection of distinct elements.
28 Definition of Set Equality Two sets are equal if and only if they contain exactly the same elements. It does not matter how the set is defined For example: {1, 2, 3, 4} = {x x is an integer where x is greater than 0 and x is less than 5 }
29 The Principle of Extensionality This states that: two sets A and B are distinct (i.e. not equal) if, and only if, there is at least one element that A and B do not have in common Example: A = {a,b,c,d} B = {a,b,c} A B
30 Basic Set Relations: element of x S ( x is in S ) object x is an lement or member of set S x S object x is not an element or member of set S
31 Example: element of relation L Stephanie Lidwina Steve M êensu P Olga Stephanie L Olga P Steve P
32 Subset relation S T ( S is a subset of T ) every element of S is also an element of T NB: This means that if S = T, then S T Example: A = {a,b,c,d} B = {b,c} B A
33 Superset relations S T ( S is a superset of T ) Every element of T is also an element of S So, S T iff T S
34 Some more on equality Since S and T are equal if they have exactly the same elements, we have that: S = T iff S T and T S
35 Subset/superset: illustration Assume that: S = {x x is a student} P = {y y is a student and y studies philosophy} S P Notation: S P P S
36 Proper (Strict) Subsets & Supersets S T ( S is a proper subset of T ) T S S T but. Example:{1,2} {1,2,3} We have {1,2,3} {1,2,3}, but not {1,2,3} {1,2,3}
37 Subset/superset: illustration Assume that: S = {x x is a student} P = {y y is a student and y studies philosophy} S P Notation: S P P S But also: P S
38 Summary of Notation A, B, : uppercase letters used for sets a B: a is an element of B A B: A is a subset of B (A may also be equal to B) A B: A is a superset of B (Again, A may also be equal to B) A B: A is a proper subset of B (A is NOT equal to B)
39 Exercise 3 Express these in symbols b is an element of A b A C is a subset of B C B A is not equal to D A D C is a proper subset of F C F
40 Part 2 Some special kinds of sets
41 Singleton sets and empty sets A set with only one element is called a singleton set sometimes referred to as a unit set Sets can also be empty. Examples of empty sets: the set of dogs that can program computers the set of female presidents of the United States
42 Some more on the empty set Recall the principle of extensionality: two sets are distinct if, and only if, they have at least one element which is in one but not in the other but this means that if two sets are empty, they must be the same set there is no element which is in one but not in the other In set theory, we say there is only one empty set ( the empty set). The empty set is a subset of every set.
43 Notation for the empty set We have seen that there exists exactly one empty set, so we can give it a name: ( the empty set ) is the unique set that contains no elements whatsoever. = {} This has a rather strange consequence: the set of dogs that can program computers = the set of female presidents of the United States
44 Cardinality and Finiteness S (read the cardinality of S ) is a measure of how many different elements S has. =0 {1,2,3} = 3 {a,b} = 2
45 Infinite Sets Sets may be infinite (i.e., not finite, without end, unending). Symbols for some special infinite sets: N = {0, 1, 2, } The Natural numbers. Z = {, -2, -1, 0, 1, 2, } The integers. R = The Real numbers, such as Blackboard Bold or double-struck font (N,Z,R) is also often used for these special number sets.
46 The Power Set Operation The power set P(S) of a set S is the set of all subsets of S. P(S) = {x x S}. E.g. P({a,b}) = {, {a}, {b}, {a,b}} NB: The set itself is a member of its own power set! NB: The empty set is always in the power set! Notice that the power set is a set of sets. Sets too can be elements of sets!
47 Exercise 4 Let A = {Edinburgh, London, Dublin} What is P(A)? {, {Edinburgh}, {London}, {Dublin}, {Edinburgh,London}, {Edinburgh,Dublin}, {London, Dublin}, {Edinburgh, Dublin, London}} What is P(A)? Observe that P(A) = 2 A
48 Summary We ve introduced one of the core discrete mathematical structures. Also some of the core relations on sets: element of subset/superset strict subset Things to remember: The Principle of Extensionality The empty set as a special case: there is only one. The powerset operation
49 Acknowledgements Some of these materials are adapted from slides by Kees van Deemter (University of Aberdeen), and Michael Frank (University of Florida)
Sets. Introduction to Set Theory ( 2.1) Basic notations for sets. Basic properties of sets CMSC 302. Vojislav Kecman
Introduction to Set Theory ( 2.1) VCU, Department of Computer Science CMSC 302 Sets Vojislav Kecman A set is a new type of structure, representing an unordered collection (group, plurality) of zero or
More informationToday s topics. Introduction to Set Theory ( 1.6) Naïve set theory. Basic notations for sets
Today s topics Introduction to Set Theory ( 1.6) Sets Definitions Operations Proving Set Identities Reading: Sections 1.6-1.7 Upcoming Functions A set is a new type of structure, representing an unordered
More informationSec$on Summary. Definition of sets Describing Sets
Section 2.1 Sec$on Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal Set Subsets and Set Equality Cardinality of Sets
More informationWith Question/Answer Animations. Chapter 2
With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationCSI30. Chapter 2. Basic Structures: Sets, Functions, Sequences, Sums. 2.1 Sets and subsets 2.2 Sets of sets
Chapter 2. Basic Structures: Sets, Functions, Sequences, Sums 2.1 Sets and subsets 2.2 Sets of sets 1 Set is an unordered collection of objects. - used to group objects together, - often the objects with
More informationLIN1032 Formal Foundations for Linguistics
LIN1032 Formal Foundations for Lecture 5 Albert Gatt In this lecture We conclude our discussion of the logical connectives We begin our foray into predicate logic much more expressive than propositional
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationDiscrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams
Contents : basic definitions and notation A set is an unordered collection of its elements (or members). The set is fully specified by its elements. Usually capital letters are used to name sets and lowercase
More informationExclusive Disjunction
Exclusive Disjunction Recall A statement is a declarative sentence that is either true or false, but not both. If we have a declarative sentence s, p: s is true, and q: s is false, can we rewrite s is
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationExtensions to the Logic of All x are y: Verbs, Relative Clauses, and Only
1/53 Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only Larry Moss Indiana University Nordic Logic School August 7-11, 2017 2/53 An example that we ll see a few times Consider the
More informationDiscrete Basic Structure: Sets
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) Discrete Basic Structure: Sets Discrete Math Team 2 -- KS091201 MD W-07 Outline What is a set? Set properties Specifying a set Often used sets The universal
More information1.1 Introduction to Sets
Math 166 Lecture Notes - S. Nite 8/29/2012 Page 1 of 5 1.1 Introduction to Sets Set Terminology and Notation A set is a well-defined collection of objects. The objects are called the elements and are usually
More informationA set is an unordered collection of objects.
Section 2.1 Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the elements, or members of the set. A set is said to contain
More informationSets. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 1 / 42 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 2.1, 2.2 of Rosen Introduction I Introduction
More informationSets. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006
Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 1 / 1 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen Introduction I We ve already
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.
Formal Methods Name: Key Midterm 2, Spring, 2007 Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.. Determine whether each of
More informationChapter 4. Basic Set Theory. 4.1 The Language of Set Theory
Chapter 4 Basic Set Theory There are two good reasons for studying set theory. First, it s a indispensable tool for both logic and mathematics, and even for other fields including computer science, linguistics,
More informationSets
Sets http://gawron.sdsu.edu/semantics Jean Mark Gawron San Diego State University, Department of Linguistics 2010-08-19 Jean Mark Gawron ( SDSU ) Gawron: Sets 2010-08-19 1 / 25 Overview 1 Sets 2 Subsets
More informationSyllogistic Logic and its Extensions
1/31 Syllogistic Logic and its Extensions Larry Moss, Indiana University NASSLLI 2014 2/31 Logic and Language: Traditional Syllogisms All men are mortal. Socrates is a man. Socrates is mortal. Some men
More informationCM10196 Topic 2: Sets, Predicates, Boolean algebras
CM10196 Topic 2: Sets, Predicates, oolean algebras Guy McCusker 1W2.1 Sets Most of the things mathematicians talk about are built out of sets. The idea of a set is a simple one: a set is just a collection
More informationLogic for Computer Science - Week 2 The Syntax of Propositional Logic
Logic for Computer Science - Week 2 The Syntax of Propositional Logic Ștefan Ciobâcă November 30, 2017 1 An Introduction to Logical Formulae In the previous lecture, we have seen what makes an argument
More informationTutorial on Axiomatic Set Theory. Javier R. Movellan
Tutorial on Axiomatic Set Theory Javier R. Movellan Intuitively we think of sets as collections of elements. The crucial part of this intuitive concept is that we are willing to treat sets as entities
More informationProseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1
Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationINTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims
Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of
More informationSets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary
An Algebra on Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing Spring, 2018 Alice E. Fischer... 1/37 An Algebra on 1 Definitions and Notation Venn Diagrams 2 An Algebra on 3 Alice E. Fischer...
More informationLecture 12. Statement Logic as a word algebra on the set of atomic statements. Lindenbaum algebra.
V. Borschev and B. Partee, October 26, 2006 p. 1 Lecture 12. Statement Logic as a word algebra on the set of atomic statements. Lindenbaum algebra. 0. Preliminary notes...1 1. Freedom for algebras. Word
More informationDiscrete Mathematics Set Operations
Discrete Mathematics 1-3. Set Operations Introduction to Set Theory A setis a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different) objects.
More informationIn this initial chapter, you will be introduced to, or more than likely be reminded of, a
1 Sets In this initial chapter, you will be introduced to, or more than likely be reminded of, a fundamental idea that occurs throughout mathematics: sets. Indeed, a set is an object from which every mathematical
More informationLecture 4: Proposition, Connectives and Truth Tables
Discrete Mathematics (II) Spring 2017 Lecture 4: Proposition, Connectives and Truth Tables Lecturer: Yi Li 1 Overview In last lecture, we give a brief introduction to mathematical logic and then redefine
More information1 Functions and Sets. 1.1 Sets and Subsets. Phil 450: The Limits of Logic Jeff Russell, Fall 2014
1 Phil 450: The Limits of Logic Jeff Russell, Fall 2014 Any statement that is not an Axiom (Ax) or a Definition (Def) or a Remark (R) or an Example is an Exercise. Unless it says otherwise, the exercise
More informationClass 29 - November 3 Semantics for Predicate Logic
Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 29 - November 3 Semantics for Predicate Logic I. Proof Theory
More informationINTRODUCTION TO LOGIC 1 Sets, Relations, and Arguments. Why logic? Arguments
The Logic Manual INTRODUCTION TO LOGIC 1 Sets, Relations, and Arguments Volker Halbach Pure logic is the ruin of the spirit. Antoine de Saint-Exupéry The Logic Manual web page for the book: http://logicmanual.philosophy.ox.ac.uk/
More informationPropositional Logic 1
Propositional Logic 1 Joseph Spring Department of Computer Science L1 - ormal Languages and Deduction Areas for Discussion Propositions Language for Representing Propositions Simple Propositions Compound
More informationLing 130 Notes: Syntax and Semantics of Propositional Logic
Ling 130 Notes: Syntax and Semantics of Propositional Logic Sophia A. Malamud January 21, 2011 1 Preliminaries. Goals: Motivate propositional logic syntax and inferencing. Feel comfortable manipulating
More informationThe Semantics of Definite DPs 1. b. Argument Position: (i) [ A politician ] arrived from Washington. (ii) Joe likes [ the politician ].
The Semantics of Definite DPs 1 Thus far, our semantics is able to interpret common nouns that occupy predicate position (1a). However, the most common position for common nouns to occupy is internal to
More informationIntroduction to Logic and Axiomatic Set Theory
Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More information(1.3.1) and in English one says a is an element of M. The statement that a is not an element of M is written as a M
1.3 Set Theory I As long as the terms of a mathematical theory are names of concrete objects as concrete as mothers breast, the very first object that received a name in human languages - there is not
More informationHomework every week. Keep up to date or you risk falling behind. Quizzes and Final exam are based on homework questions.
Week 1 Fall 2016 1 of 25 CISC-102 Fall 2016 Week 1 David Rappaport daver@cs.queensu.ca Goodwin G-532 Office Hours: Monday 1:00-3:00 (or by appointment) Homework Homework every week. Keep up to date or
More informationCISC-102 Fall 2017 Week 1 David Rappaport Goodwin G-532 Office Hours: Tuesday 1:30-3:30
Week 1 Fall 2017 1 of 42 CISC-102 Fall 2017 Week 1 David Rappaport daver@cs.queensu.ca Goodwin G-532 Office Hours: Tuesday 1:30-3:30 Homework Homework every week. Keep up to date or you risk falling behind.
More informationPropositional Logic and Semantics
Propositional Logic and Semantics English is naturally ambiguous. For example, consider the following employee (non)recommendations and their ambiguity in the English language: I can assure you that no
More informationPhil Introductory Formal Logic
Phil 134 - Introductory Formal Logic Lecture 4: Formal Semantics In this lecture we give precise meaning to formulae math stuff: sets, pairs, products, relations, functions PL connectives as truth-functions
More information27. THESE SENTENCES CERTAINLY LOOK DIFFERENT
27 HESE SENENCES CERAINLY LOOK DIEREN comparing expressions versus comparing sentences a motivating example: sentences that LOOK different; but, in a very important way, are the same Whereas the = sign
More informationSection 2.1: Introduction to the Logic of Quantified Statements
Section 2.1: Introduction to the Logic of Quantified Statements In the previous chapter, we studied a branch of logic called propositional logic or propositional calculus. Loosely speaking, propositional
More informationMA103 STATEMENTS, PROOF, LOGIC
MA103 STATEMENTS, PROOF, LOGIC Abstract Mathematics is about making precise mathematical statements and establishing, by proof or disproof, whether these statements are true or false. We start by looking
More information1. SET 10/9/2013. Discrete Mathematics Fajrian Nur Adnan, M.CS
1. SET 10/9/2013 Discrete Mathematics Fajrian Nur Adnan, M.CS 1 Discrete Mathematics 1. Set and Logic 2. Relation 3. Function 4. Induction 5. Boolean Algebra and Number Theory MID 6. Graf dan Tree/Pohon
More informationMAGIC Set theory. lecture 1
MAGIC Set theory lecture 1 David Asperó University of East Anglia 15 October 2014 Welcome Welcome to this set theory course. This will be a 10 hour introduction to set theory. The only prerequisite is
More informationChapter 6. Relations. 6.1 Relations
Chapter 6 Relations Mathematical relations are an extremely general framework for specifying relationships between pairs of objects. This chapter surveys the types of relations that can be constructed
More informationIntroduction to Set Operations
Introduction to Set Operations CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 21 st October 2011 Outline 1 Recap 2 Introduction to sets 3 Class Exercises
More information27. THESE SENTENCES CERTAINLY LOOK DIFFERENT
get the complete book: http://wwwonemathematicalcatorg/getullextullbookhtm 27 HESE SENENCES CERAINLY LOOK DIEREN comparing expressions versus comparing sentences a motivating example: sentences that LOOK
More informationProbability Theory Review
Cogsci 118A: Natural Computation I Lecture 2 (01/07/10) Lecturer: Angela Yu Probability Theory Review Scribe: Joseph Schilz Lecture Summary 1. Set theory: terms and operators In this section, we provide
More information6c Lecture 14: May 14, 2014
6c Lecture 14: May 14, 2014 11 Compactness We begin with a consequence of the completeness theorem. Suppose T is a theory. Recall that T is satisfiable if there is a model M T of T. Recall that T is consistent
More informationSET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas.
SETS: set is a well-defined collection of objects. SET THEORY The objects in a set are called elements or members of the set. If x is an object of set, we write x and is read as x is an element of set
More informationGÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem
GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS BEN CHAIKEN Abstract. This paper will discuss the completeness and incompleteness theorems of Kurt Gödel. These theorems have a profound impact on the philosophical
More informationcse541 LOGIC FOR COMPUTER SCIENCE
cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax
More information= A. Example 2. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {4, 6, 7, 9, 10}, and B = {2, 6, 8, 9}. Draw the sets on a Venn diagram.
MATH 109 Sets A mathematical set is a well-defined collection of objects A for which we can determine precisely whether or not any object belongs to A. Objects in a set are formally called elements of
More information1 FUNDAMENTALS OF LOGIC NO.10 HERBRAND THEOREM Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical connectives (,,, ) Truth table Tautology
More informationA Little History Incompleteness The First Theorem The Second Theorem Implications. Gödel s Theorem. Anders O.F. Hendrickson
Gödel s Theorem Anders O.F. Hendrickson Department of Mathematics and Computer Science Concordia College, Moorhead, MN Math/CS Colloquium, November 15, 2011 Outline 1 A Little History 2 Incompleteness
More informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More informationA B is shaded A B A B
NION: Let and be subsets of a universal set. The union of sets and is the set of all elements in that belong to or to or to both, and is denoted. Symbolically: = {x x or x } EMMPLE: Let = {a, b, c, d,
More informationRecall that the expression x > 3 is not a proposition. Why?
Predicates and Quantifiers Predicates and Quantifiers 1 Recall that the expression x > 3 is not a proposition. Why? Notation: We will use the propositional function notation to denote the expression "
More informationWhy write proofs? Why not just test and repeat enough examples to confirm a theory?
P R E F A C E T O T H E S T U D E N T Welcome to the study of mathematical reasoning. The authors know that many students approach this material with some apprehension and uncertainty. Some students feel
More informationQuantification in the predicate calculus
Quantification in the predicate calculus PHIL 43916 eptember 5, 2012 1. The problem posed by quantified sentences... 1 2. yntax of PC... 2 3. Bound and free iables... 3 4. Models and assignments... 4 5.
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationCSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4
CSE 20 Lecture 4: Introduction to Boolean algebra Reminder First quiz will be on Friday (17th January) in class. It is a paper quiz. Syllabus is all that has been done till Wednesday. If you want you may
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationMAGIC Set theory. lecture 2
MAGIC Set theory lecture 2 David Asperó University of East Anglia 22 October 2014 Recall from last time: Syntactical vs. semantical logical consequence Given a set T of formulas and a formula ', we write
More informationPredicate Logic: Sematics Part 1
Predicate Logic: Sematics Part 1 CS402, Spring 2018 Shin Yoo Predicate Calculus Propositional logic is also called sentential logic, i.e. a logical system that deals with whole sentences connected with
More information1. From Lewis Carroll: extract a pair of premises and finish the conclusion.
Math 2200 2. Treibergs σιι First Midterm Exam Name: Sample January 26, 2011 Sample First Midterm Questions. Sept. 17, 2008 and Sept. 16, 2009. Some questions from Math 3210 Midterms of 1. From Lewis Carroll:
More informationKnowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.
Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes
More informationWelcome to CS103! Two Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation
Welcome to CS103! Two Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation Course Staff Keith Schwarz (htiek@cs.stanford.edu) Kyle Brogle (broglek@stanford.edu) Maurizio
More informationDiscrete Mathematical Structures: Theory and Applications
Chapter 1: Foundations: Sets, Logic, and Algorithms Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about sets Explore various operations on sets Become familiar with
More informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
More informationa. ~p : if p is T, then ~p is F, and vice versa
Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.
More informationCITS2211 Discrete Structures. Propositional Logic
CITS2211 Discrete Structures Propositional Logic Unit coordinator: Rachel Cardell-Oliver July 31, 2017 Highlights This lecture will address the following questions: 1 What is a proposition? 2 How are propositions
More informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationCITS2211 Discrete Structures (2017) Cardinality and Countability
CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics
More informationPhilosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014
Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014 Class #23 - Translation into Predicate Logic II ( 3.2) Only as a Quantifier P Only Ps are Qs is logically equivalent to all Qs are
More informationStudy skills for mathematicians
PART I Study skills for mathematicians CHAPTER 1 Sets and functions Everything starts somewhere, although many physicists disagree. Terry Pratchett, Hogfather, 1996 To think like a mathematician requires
More informationMath 301 Spring 2019
Math 301 Spring 2019 David Ross Department of Mathematics University of Hawaii Revised: January 14, 2019 1 1 Some notation: N = 0, 1, 2, 3,... (The natural numbers) Note Z = 0, ±1, ±2, ±3,... (The integers)
More information(c) Give a proof of or a counterexample to the following statement: (3n 2)= n(3n 1) 2
Question 1 (a) Suppose A is the set of distinct letters in the word elephant, B is the set of distinct letters in the word sycophant, C is the set of distinct letters in the word fantastic, and D is the
More informationRussell s logicism. Jeff Speaks. September 26, 2007
Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................
More informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
More informationProving simple set properties...
Proving simple set properties... Part 1: Some examples of proofs over sets Fall 2013 Proving simple set properties... Fall 2013 1 / 17 Introduction Overview: Learning outcomes In this session we will...
More informationGeneralized Quantifiers Logical and Linguistic Aspects
Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun
More informationLogic and Mathematics:
Logic and Mathematics: Mathematicians in Schools Program Lashi Bandara Mathematical Sciences Institute, Australian National University April 21, 2011 Contents 1 Russell s Paradox 1 2 Propositional Logic
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationWelcome to CS103! Three Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation
Welcome to CS103! Three Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation Course Staff Keith Schwarz (htiek@cs.stanford.edu) Rakesh Achanta (rakesha@stanford.edu) Kyle
More informationLogic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1
Logic One reason for studying logic is that we need a better notation than ordinary English for expressing relationships among various assertions or hypothetical states of affairs. A solid grounding in
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationCS2742 midterm test 2 study sheet. Boolean circuits: Predicate logic:
x NOT ~x x y AND x /\ y x y OR x \/ y Figure 1: Types of gates in a digital circuit. CS2742 midterm test 2 study sheet Boolean circuits: Boolean circuits is a generalization of Boolean formulas in which
More informationMath 3201 Unit 1 Set Theory
Math 3201 Unit 1 Set Theory Overview In this unit, we will organize information into. We will use diagrams to illustrate between sets and subsets and use to describe sets. We will determine the in each
More informationMath 1 Variable Manipulation Part 5 Absolute Value & Inequalities
Math 1 Variable Manipulation Part 5 Absolute Value & Inequalities 1 ABSOLUTE VALUE REVIEW Absolute value is a measure of distance; how far a number is from zero: 6 is 6 away from zero, and " 6" is also
More information