Formal sciences

Heapsort

Sorting algorithms

Complexity classes

Compactness

Exponential tightness

Mutual exclusion

F statistic

Model checking

Model theory

Transfinite recursion

Non-projective structure

Shift-reduce parsing

Dependency reachability

Noether current

Dimensionless parameter

Karoubi completion

Redundant component

Pseudo-counts

Fusion frames

Jeffreys’ divergence

Confluence

Parameter-Bounded Rewriting

Snake lemma

Unobservable subspace

CP decomposition

Invariant theory

Posterior predictive distribution

Lower bounds

SMT modulo theories

Tableaux

Cut elimination

Inference rule

Type system

Predicate

Partial order

Logical equivalence

Phasor

Complex representation

FOLLOW set

LL parsing

Predictive parsing

Left recursion

Parsing table

Shift-reduce conflict

Parse table

Parse tree

Chart parsing

Support

Tempered distribution

Derived functor