Mathematical Methods in Linguistics. Basic Concepts of Set Theory.

Slides:



Advertisements
Similar presentations
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
Advertisements

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
Denoting the beginning
Lecture 3 Set Operations & Set Functions. Recap Set: unordered collection of objects Equal sets have the same elements Subset: elements in A are also.
Sets. Copyright © Peter Cappello Definition Visualize a dictionary as a directed graph. Nodes represent words If word w is defined in terms of word.
CSC 2300 Data Structures & Algorithms January 16, 2007 Chapter 1. Introduction.
February 5, 2015Applied Discrete Mathematics Week 1: Logic and Sets 1 Homework Solution PQ  (P  Q) (  P)  (  Q)  (P  Q)  (  P)  (  Q) truetruefalsefalsetrue.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Sets.
Discrete Mathematics Unit - I. Set Theory Sets and Subsets A well-defined collection of objects (the set of outstanding people, outstanding is very subjective)
Set theory Sets: Powerful tool in computer science to solve real world problems. A set is a collection of distinct objects called elements. Traditionally,
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
Logics for Data and Knowledge Representation Introduction to Algebra Chiara Ghidini, Luciano Serafini, Fausto Giunchiglia and Vincenzo Maltese.
2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
1 Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 1 Adaptation to this.
CSCI 2670 Introduction to Theory of Computing Instructor: Shelby Funk.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
1.4 Sets Definition 1. A set is a group of objects . The objects in a set are called the elements, or members, of the set. Example 2 The set of positive.
Language: Set of Strings
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
1. Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element of A” A = {a 1, a 2,
CompSci 102 Discrete Math for Computer Science
Chapter 2 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Unit 2 Sets.
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
ELEMENTARY SET THEORY.
Discrete Mathematical Structures 4 th Edition Kolman, Busby, Ross © 2000 by Prentice-Hall, Inc. ISBN
Module Code MA1032N: Logic Lecture for Week Autumn.
Mathematical Preliminaries
Sets Goal: Introduce the basic terminology of set theory.
THEORY OF COMPUTATION Komate AMPHAWAN 1. 2.
Chapter 2 With Question/Answer Animations. Section 2.1.
Introduction Episode 0 What is TOC (Theory of Computation) about? Giorgi Japaridze Theory of Computability Subject: The fundamental mathematical properties.
12/19/20151 … and now for something completely different… Set Theory Actually, you will see that logic and set theory are very closely related.
(CSC 102) Lecture 13 Discrete Structures. Previous Lectures Summary  Direct Proof  Indirect Proof  Proof by Contradiction  Proof by Contra positive.
Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com ICOM 5016 – Introduction.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
Discrete Mathematics CS 2610 January 27, part 2.
Discrete Mathematics Set.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Fr: Discrete Mathematics by Washburn, Marlowe, and Ryan.
Introduction to Graph Theory & its Applications
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
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.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 1 The Foundations: Logic, Sets,
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
Sets.
Applied Discrete Mathematics Week 1: Logic and Sets
CHAPTER 2 Set Theory A B C.
Introduction Chapter 0.
BCS2143 – Theory of Computer Science
Lecture 1 Theory of Automata
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
Teori Bahasa dan Automata Lecture 1: Course Overview and Introduction
Discrete Mathematics CS 2610
Teori Bahasa dan Automata Lecture 1: Course Overview and Introduction
Introduction Chapter 0.
More about Sets.
ICOM 5016 – Introduction to Database Systems
Lecture Sets 2.2 Set Operations.
SETS, RELATIONS, FUNCTIONS
ICOM 5016 – Introduction to Database Systems
Presentation transcript:

Mathematical Methods in Linguistics

Basic Concepts of Set Theory

FST - Torbjörn Lager, UU 3 What Is a Set? zAn abstract collection of distinct object (its members) zCan have (almost) anything as a member, including other sets zMay be small (even empty) or large (even infinite)

FST - Torbjörn Lager, UU 4 Specification of Sets zList notation (enumeration) zDiagram zPredicate notation zRecursive rules zFor an example, see page 9 in MML

FST - Torbjörn Lager, UU 5 Identity and Cardinality zIdentity y{Torbjörn Lager} = {x | x is the teacher in C389} zCardinality y|A| means "the number of elements in the set A"

FST - Torbjörn Lager, UU 6 The Member and Subset Relations za  A means "a is a member of the set A" zA  B means "every element of A is also an element of B" zA  B means "every element of A is also an element of B and there is at least one element of B which is not in A" za  B means a  B does not hold zA  B means A  B does not hold

FST - Torbjörn Lager, UU 7 Powerset zThe powerset of a set A is the set of all subsets of A zE.g the powerset of {a,b} is {{a,b},{a},{b},Ø}

FST - Torbjörn Lager, UU 8 Union and Intersection zThe union of two sets A and B, written A  B, is the set of all objects that are members of either the set A or the set B (or both) zThe intersection (sv: "snittet") of two sets A and B, written A  B, is the set of all objects that are members of both the set A and the set B

FST - Torbjörn Lager, UU 9 Difference and Complement zThe difference between two sets A and B, written A-B, is all the elements of A which are not also elements of B zThe complement of a set A and B, written A', is all the elements which are not in A zA complement of a set is always relative to a universe U. It also holds that A' = U-A

FST - Torbjörn Lager, UU 10 Set Theoretic Equalities zSee page 18 in MML

Relations and Functions

FST - Torbjörn Lager, UU 12 Ordered Pairs and Cartesian Products zThe Cartesian product (sv: "kryssprodukten") of A and B, written A  B, is the set of pairs such that x is an element in A and y is an element in B

FST - Torbjörn Lager, UU 13 Functions: Domain and Range rop tro meta jul ful mat ta få feg be klo se Domain Range 5 6 1

FST - Torbjörn Lager, UU 14 A Function zA set of pairs zEach element is in the domain is paired with just one element in the range zA subset of a Cartesian product A  B can be called a function just in case every member of A occurs exactly once a the first element in a pair

FST - Torbjörn Lager, UU 15 Functions (cont'd) rop tro meta jul ful mat ta få feg be klo se Domain Range 5 6

Properties of Relations page in MML this part is optional

Lecture 2: Logic and Formal Systems

FST - Torbjörn Lager, UU 18 Basic Concepts of Logic and Formal Systems

FST - Torbjörn Lager, UU 19 Statement Logic

FST - Torbjörn Lager, UU 20 Predicate Logic

Lecture 3: Knowledge and Meaning Representation

Lecture 4: English as a Formal Language

FST - Torbjörn Lager, UU 23 Compositionality

FST - Torbjörn Lager, UU 24 Lambda Abstraction

Lecture 5: Finite Automata, Regular Languages and Type 3 Grammars

Lecture 6: Pushdown Automata, Context Free Grammars and Languages Lecture 6: Feature Structures and Equations

Lecture 7: Feature Structures and Unification-Based Grammars