Forcing
Abstract
Forcing is extensively used in computability and computable structure theory. We use it to show various classical computable structure theory results.The version we developed here is only aesthetically new, and matches the style of the definitions of the book.
Fields of Study & Subjects
Computability
Logic
AI Algorithms
Advanced Topology and Set Theory
programming
and type systems
Publication details
- Journal / source
- Cambridge University Press eBooks
- Pages
- 101–124
- Publication date
- 30 January 2026
- Document type
- Book chapter