Comparison of fine structural mice via coarse iteration
classification
🧮 math.LO
keywords
coarsefineiterationprocessstructuralbackgroundedcomparingcomparison
read the original abstract
Let M be a fine structural mouse. Let D be a fully backgrounded L[E]-construction computed inside an iterable coarse premouse S. We describe a process comparing M with D, through forming iteration trees on M and on S. We then prove that this process succeeds.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.