Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T16:15:15.228Z Has data issue: false hasContentIssue false

A uniqueness theorem for iterations

Published online by Cambridge University Press:  12 March 2014

Paul Larson*
Affiliation:
Department of Mathematics, University of Toronto, Toronto M5S 3G3, Canada, E-mail: larson@math.toronto.edu

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable