Publication | Closed Access
A uniqueness theorem for iterations
12
Citations
2
References
2002
Year
Computational Complexity TheoryX ∈ NParameterized ComplexityReal XCountable Transitive ModelModel TheoryComputational ComplexityUniqueness TheoremFinite Model TheoryComputability Theory
Abstract If M is a countable transitive model of , then for every real x there is a unique shortest iteration j : M → N with x ∈ N , or none at all.
| Year | Citations | |
|---|---|---|
Page 1
Page 1