Rigorous Reasoning

Concept · Foundations

Relation

A binary relation from A to B is a subset R ⊆ A × B; elements (a, b) ∈ R are usually written a R b.

Why it matters

Every kind of structure in mathematics — order, equivalence, function, graph — is ultimately a relation, and treating relations as sets of ordered pairs gives them rigorous definitions.

Where this shows up

Units and lessons using this concept

Following the links will take you to the page where this term is introduced in context.

Related

Other concepts in Foundations

A, E, I, O PropositionsAccessibility RelationArgumentAtomic StatementAuthorial IntentBase RateBayes FactorBurden of Proof in InterpretationCalibrationCardinalityCartesian ProductCategorical Proposition