scientific article; zbMATH DE number 3250555

MaRDI QIDQ5537368zbMATH OpenFDO

Authors R. O. Gandy

Publication date 1960

zbMATH Keywords

mathematical logic

Cited in

(15)

• The completeness theorem for typing lambda-terms
• Completeness of the hyperarithmetic isomorphism equivalence relation
• Decision times of infinite computations
• On revision operators
• Hyperarithmetical Sets
• An application of recursion theory to analysis
• On the Π₁ ¹ -separation principle
• Comparing Peano arithmetic, Basic Law V, and Hume's Principle
• Classes of Polish spaces under effective Borel isomorphism
• Recursive Pseudo-Well-Orderings
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• Degrees of Nonrecursive Presentability
• Higher Kurtz randomness
• Parametrization over inductive relations of a bounded number of variables
• Lowness of higher randomness notions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5537368)