Find Proofs of Computability, Incompleteness and Recursion Theory Results Using the Arithmetic Hierarchy
$30-250 USD
S-au achitat serviciile după ce au fost prestate
I am interested in finding proofs of famous theorems using the Kleene Arithmetic Hierarchy (KAH). In particular, there are theorems from Computability (aka Theory of Computation i.e. Turing 1937), Incompleteness in Logic (Godel 1931, Rosser 1937) and Recursion Theory (Kleene: Self-Outputting Program, Fixed Point Theorem) that can be proven using fundamental theorems about KAH: KAH does not collapse. The only identical categories are A0 and E0, the recursive relations. [KAH,A0,E0 are my own abbreviations.]
ID Proiect: #28450238
