Church's Theorem
Church proved several important theorems that now go by the name Church's theorem.
One of Church's theorems states that there is no consistent decidable extension of Peano arithmetic (Wolf 2005).
Church (1936) also proved that the set of first-order tautologies with at least one at least binary predicate or at least two at least unary function symbols is not recursive.
Contact the MathWorld Team
C2v point group