Index

Symbols

\exists

\forall

A

antisymmetric

B

bijective binary relation

binary tree height bipartite graph bound variable

C

cardinality Cartesian product clique codomain combination comparable complete bipartite graph complete graph composition congruence class

congruent conjecture connected connected component consistent contingency contradiction corollary countably infinite cover cycle graph

D

DAG directed acycling graph directed graph directed path

disjoint sets divisible domain domain of definition domain of discourse

E

empty set equally-likely equivalence class equivalence relation

Euler circuit Euler path event existential quantifier experiment

F

finite set

free variable

G

genealized pigeon hole principle

graph greatest common divisor

H

Hamilton circuit

Hamilton path

I

in-degree injective

intersection inverse function isomorphic graphs

L

least common multiple

lemma loop invariant

M

maximal maximal clique maximum

minimal minimum monotonic function

N

neighbourhood

non-decreasing non-increasing

O

open formula

order of a graph out-degree

P

partial function partial order partially ordered set partition path permutation pigeon hole principle planar graph poset power set

predicate predicate Logic prime product rule proof proper subgraph proposition (logic) propositional formula propositional function propositional logic

Q

quantifier

R

range rational number recurrence relation recursive definition

reflexive relatively prime rooted subtree rooted tree

S

sample space satisfiable sequence set intersection set union simple graph singleton

string strongly connected component subgraph subset sum rule surjective symmetric

T

tautology theorem total total order totally ordered set

transitive tree trivial proof truth assignment tuple

U

uncountably infinite underlying graph union

univalent universal quantifier universal set universe

V

vacuous proof

variable

W

weakly connected component well-ordered

well-ordering principle wheel graph