Hyperarithmetical quantifiers

DOI10.4064/fm-48-3-313-320zbMath0098.24301OpenAlexW4234930915MaRDI QIDQ3278335

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

Related Items

Members of countable \(\Pi ^ 0_ 1\) classes, Completeness of the hyperarithmetic isomorphism equivalence relation, Decision times of infinite computations, Countable admissible ordinals and hyperdegrees, Recursive Pseudo-Well-Orderings, Classes of Polish spaces under effective Borel isomorphism, Higher Kurtz randomness, Comparing Peano arithmetic, Basic Law V, and Hume's Principle, Parametrization over inductive relations of a bounded number of variables, Measure-Theoretic Uniformity in Recursion Theory and Set Theory, Hyperarithmetical Sets, Lowness of higher randomness notions, COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS, AN APPLICATION OF RECURSION THEORY TO ANALYSIS