Higher set theory and mathematical practice

DOI10.1016/0003-4843(71)90018-0zbMath0215.32702OpenAlexW2049288284WikidataQ59594738 ScholiaQ59594738MaRDI QIDQ5618369

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

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

Related Items (48)

Differential Game Logic ⋮ The determinacy of Blackwell games ⋮ Reverse Mathematics: The Playground of Logic ⋮ How recent work in mathematical logic relates to the foundations of mathematics ⋮ Necessary uses of abstract set theory in finite mathematics ⋮ On Σ₁¹ equivalence relations with Borel classes of bounded rank ⋮ Finite level Borel games and a problem concerning the jump hierarchy ⋮ Δ₃^O-determinacy, comprehension and induction ⋮ The axiom of determinacy and the modern development of descriptive set theory ⋮ Mathematics as a quasi-empirical science ⋮ THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Determinacy of adversarial Gowers games ⋮ ReGale: some memorable results ⋮ Weihrauch Degrees of Finding Equilibria in Sequential Games ⋮ VARIATIONS ON DETERMINACY AND ℵ_ω1 ⋮ Determinacy in third order arithmetic ⋮ Proving Theorems from Reflection ⋮ Open determinacy for class games ⋮ THE CONSISTENCY STRENGTH OF LONG PROJECTIVE DETERMINACY ⋮ ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ A combinatorial property of Fréchet iterated filters ⋮ Fraïssé’s conjecture in Π11-comprehension ⋮ The Π21$\Pi ^1_2$ consequences of a theory ⋮ Ramsey theory without pigeonhole principle and the adversarial Ramsey principle ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ On the necessary use of abstract set theory ⋮ In Praise of Replacement ⋮ The limits of determinacy in second order arithmetic: consistency and complexity strength ⋮ Too naturalist and not naturalist enough: Reply to Horsten ⋮ Determinateness and Continuity ⋮ Why Sets? ⋮ THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS ⋮ Long Borel games ⋮ On the independence of core-equivalence results from Zermelo-Fraenkel set theory ⋮ \({\Pi^1_2}\)-comprehension and the property of Ramsey ⋮ Surrealist landscape with figures (a survey of recent results in set theory) ⋮ CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY ⋮ Determinacy separations for class games ⋮ Turing determinacy and the continuum hypothesis ⋮ Borel equivalence relations induced by actions of the symmetric group ⋮ Another Use of Set Theory ⋮ Effective randomness for continuous measures ⋮ Large cardinals, inner models, and determinacy: an introductory overview ⋮ A critical appraisal of second-order logic ⋮ GAMES AND INDUCTION ON REALS ⋮ A Lipschitz determinacy principle equivalent to weak König lemma ⋮ Uniformity, universality, and computability theory ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC

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