scientific article; zbMATH DE number 3446873
From MaRDI portal
Publication:4770951
zbMath0285.02038MaRDI QIDQ4770951
No author found.
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items (13)
An inside/outside Ramsey theorem and recursion theory ⋮ Reverse mathematical bounds for the termination theorem ⋮ Term extraction and Ramsey's theorem for pairs ⋮ Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles ⋮ Primitive recursive reverse mathematics ⋮ HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ Some Questions in Computable Mathematics ⋮ A Combinatorial Bound for a Restricted Form of the Termination Theorem ⋮ Thin set theorems and cone avoidance ⋮ RAMSEY’S THEOREM FOR PAIRS ANDKCOLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC ⋮ In search of the first-order part of Ramsey's theorem for pairs
This page was built for publication:
