Similar to ポストの定理

Complete numbering

Computably inseparable

Effective Polish space

Creative and productive sets

Simple set

Low basis theorem

Halting problem

Numbering (computability theory)

Double recursion

Hardy hierarchy

Busy beaver

Friedberg numbering

Rice–Shapiro theorem

Veblen function

Arithmetical hierarchy

Projective hierarchy

Borel hierarchy

Herbrand's theorem

Deduction theorem

Cut-elimination theorem

Cantor's theorem

Goodstein's theorem

Craig interpolation

Gödel's speed-up theorem

Gödel's completeness theorem

Gödel's incompleteness theorems

Kőnig's theorem (set theory)

Compactness theorem