MATH2301
Games, Graphs and Machines
Lecture 5
Par<al Orders: [email protected]
Ref: Notes 1.3
MATH2301 Lecture 5
1
Deni<on (7)
In a par<ally ordered set S with par<al order (formally
we might say Let P=
The University of Sydney
MATH1003 Integral Calculus and Modelling
Summer School
Exercises and Solutions for Assignment 1
2015
This assignment is due on Tuesday, 20 January, 2015, and should be handed
The University of Sydney
MATH1003 Integral Calculus and Modelling
Summer School
Exercises and Solutions for Assignment 1
2015
This assignment is due on Tuesday, 20 January, 2015, and should be handed
MATH2301
Games, Graphs and Machines
Lecture 6
Par<al Orders: Realisers
Ref: Notes 1.3
MATH2301 Lecture 6
1
Deni<on (15)
A total order on a set A is said to be
compatible with a partial order
MATH 2301
Games, Graphs and Machines
Lecture 1
Informa=on and Introduc=on
MATH2301 Lecture 1
1
Your Lecturer
Malcolm Brooks [email protected]
Oce: John Dedman Bulding; JD G4
Oce ho
MATH2301
Games, Graphs and Machines
Lecture 4
Par<al Orders: Hasse Diagrams
Ref: Notes 1.3
MATH2301 Lecture 4
1
Introduc<on
The rela<on imposes an order on N; e.g. we
can say 2 comes before
MATH2301
Games, Graphs and Machines
Lecture 2
Binary Relations
Ref: Notes 1.1
MATH2301 Lecture 2
1
Background Definition
The Cartesian Product ST of
two sets S and T is the set of
all possible ordered
MATH2301
Games, Graphs and Machines
Lecture 3
Properties of Relations
Ref: Notes 1.2
MATH2301 Lecture 3
1
Background Notation
Symbols from logic and arithmetic:
= For all or For each etc
= There exi
The University of Sydney
MATH1003 Integral Calculus and Modelling
Summer School
Exercises and Solutions for Assignment 2
2015
This assignment is due on Tuesday, 3 February, 2015, and should be handed