Proof Theory And Combinatorics

← Back to Domain-Specific Abstractions by Domain

1 domain-specific abstractions whose origin domain is Proof Theory And Combinatorics.

• Paris–Harrington theorem — A strengthened finite Ramsey statement that is true in the standard natural numbers but not provable in first-order Peano arithmetic.