Higher set theory and mathematical practice

DOI10.1016/0003-4843(71)90018-0MaRDI QIDQ5618369zbMATH OpenOpenAlexWikidataFDO

Authors Harvey M. Friedman

Publication date 1971

Published in Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0003-4843(71)90018-0

Mathematics Subject Classification ID

Axiomatics of classical set theory and its fragments (03E30) Inner models, including constructibility, ordinal definability, and core models (03E45)

Cited in

(53)

• \({\Pi^1_2}\)-comprehension and the property of Ramsey
• How recent work in mathematical logic relates to the foundations of mathematics
• Necessary uses of abstract set theory in finite mathematics
• The axiom of determinacy and the modern development of descriptive set theory
• On the necessary use of abstract set theory
• On the independence of core-equivalence results from Zermelo-Fraenkel set theory
• Borel equivalence relations induced by actions of the symmetric group
• Turing determinacy and the continuum hypothesis
• Long Borel games
• A Lipschitz determinacy principle equivalent to weak König lemma
• Determinacy separations for class games
• Large cardinals, inner models, and determinacy: an introductory overview
• ReGale: some memorable results
• Determinacy in third order arithmetic
• Another Use of Set Theory
• A critical appraisal of second-order logic
• Reverse mathematics: the playground of logic
• Determinacy of adversarial Gowers games
• Weihrauch degrees of finding equilibria in sequential games
• On Σ₁¹ equivalence relations with Borel classes of bounded rank
• Finite level Borel games and a problem concerning the jump hierarchy
• A combinatorial property of Fréchet iterated filters
• The determinacy of Blackwell games
• Fraïssé's conjecture in \(\Pi_1^1\)-comprehension
• The limits of determinacy in second order arithmetic: consistency and complexity strength
• The ramified analytical hierarchy using extended logics
• CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
• GAMES AND INDUCTION ON REALS
• Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
• VARIATIONS ON DETERMINACY AND ℵ_ω1
• The consistency strength of long projective determinacy
• Ramsey theory without pigeonhole principle and the adversarial Ramsey principle
• Uniformity, universality, and computability theory
• The prehistory of the subsystems of second-order arithmetic
• Differential game logic
• Δ₃^O-determinacy, comprehension and induction
• Open determinacy for class games
• Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
• In praise of replacement
• Why Sets?
• Determinateness and Continuity
• Effective randomness for continuous measures
• Proving Theorems from Reflection
• ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
• The Π21\Pi ^1_2 consequences of a theory
• Iterated priority arguments in descriptive set theory
• Determinacy on the edge of second-order arithmetic. I
• The metamathematics of separated determinacy
• The hidden use of new axioms
• A formalization of Borel determinacy in Lean
• Surrealist landscape with figures (a survey of recent results in set theory)
• Mathematics as a quasi-empirical science
• Too naturalist and not naturalist enough: Reply to Horsten

This page was built for publication: Higher set theory and mathematical practice

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