Hyperarithmetical quantifiers

DOI10.4064/FM-48-3-313-320MaRDI QIDQ3278335zbMATH OpenOpenAlexFDO

Authors Clifford Spector

Publication date 1960

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/213567

zbMATH Keywords

philosophy and foundation of mathematics

Cited in

(14)

• Members of countable \(\Pi ^ 0_ 1\) classes
• Countable admissible ordinals and hyperdegrees
• Completeness of the hyperarithmetic isomorphism equivalence relation
• Decision times of infinite computations
• Hyperarithmetical Sets
• An application of recursion theory to analysis
• Comparing Peano arithmetic, Basic Law V, and Hume's Principle
• Computability theory, nonstandard analysis, and their connections
• Classes of Polish spaces under effective Borel isomorphism
• Recursive Pseudo-Well-Orderings
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• Higher Kurtz randomness
• Parametrization over inductive relations of a bounded number of variables
• Lowness of higher randomness notions

This page was built for publication: Hyperarithmetical quantifiers

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