Math: Definitions of Reflexive, Symmetric, Transitive Relations and Partially Ordered Sets, Quizzes of Discrete Mathematics

Definitions of various mathematical concepts including reflexive, symmetric, transitive relations, equivalence relations, equivalence classes, and partially ordered sets. It also introduces warshall's theorem and the concept of well-ordered and totally ordered sets.

Typology: Quizzes

2012/2013

Uploaded on 12/17/2013

tiffany112257
tiffany112257 🇺🇸

15 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
TERM 1
reflexive
DEFINITION 1
related to itself
TERM 2
symmetric
DEFINITION 2
a to be and b to a
TERM 3
transitive
DEFINITION 3
a to b and b to c implies a to c
TERM 4
equivalence relation
DEFINITION 4
reflexive symmetric transitive
TERM 5
equivalence class
DEFINITION 5
set of element related to a [a]
pf2

Partial preview of the text

Download Math: Definitions of Reflexive, Symmetric, Transitive Relations and Partially Ordered Sets and more Quizzes Discrete Mathematics in PDF only on Docsity!

TERM 1

reflexive

DEFINITION 1 related to itself TERM 2

symmetric

DEFINITION 2 a to be and b to a TERM 3

transitive

DEFINITION 3 a to b and b to c implies a to c TERM 4

equivalence relation

DEFINITION 4 reflexive symmetric transitive TERM 5

equivalence class

DEFINITION 5 set of element related to a [a]

TERM 6

warshalls theorem

DEFINITION 6 w0 = original adjacency matrixw1= all path that can be formed through the first element as the intermediatew2 = all path that can be formed through the first and the second element as the intermediate( separately)...last one gives you the transitive closure TERM 7

partially ordered sets posets

DEFINITION 7 reflexive antisymmetric transitive TERM 8

well ordered

DEFINITION 8 In mathematics, a well-order relation on a set S is a total order on S with the property that every non-empty subset of S has a least element in this ordering. TERM 9

totally ordered

DEFINITION 9 every element is paired using the relation givenIn mathematics, a linear order, total order, simple order, or ordering is a binary relation (here denoted by infix ) on some set X.