Minimal coding

DOI10.1016/0168-0072(89)90002-XzbMath0667.03038OpenAlexW4213052641MaRDI QIDQ1117220

Sy-David Friedman

Publication date: 1989

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(89)90002-x

zbMATH Keywords

adding minimal realsforcing by perfect treesJensen's coding theorem

Mathematics Subject Classification ID

Consistency and independence results (03E35)

Related Items (2)

A combinatorial forcing for coding the universe by a real when there are no sharps ⋮ EQUIVALENCE RELATIONS WHICH ARE BOREL SOMEWHERE

Cites Work

• Countable admissible ordinals and hyperdegrees
• Aspects of constructibility
• A guide to “Coding the universe” by Beller, Jensen, Welch
• The fine structure of the constructible hierarchy
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal coding