Mouse (set theory)

From Wikipedia, the free encyclopedia
(Redirected from Mouse (Set Theory))
Jump to navigation Jump to search

In set theory, a mouse is a small model of (a fragment of) Zermelo–Fraenkel set theory with desirable properties. The exact definition depends on the context. In most cases, there is a technical definition of "premouse" and an added condition of iterability (referring to the existence of wellfounded iterated ultrapowers): a mouse is then an iterable premouse. The notion of mouse generalizes the concept of a level of Gödel's constructible hierarchy while being able to incorporate large cardinals.

Mice are important ingredients of the construction of core models. The concept was isolated by Ronald Jensen in the 1970s and has been used since then in core model constructions of many authors.

Generally, a mouse exists iff 0 exists[1]p. 661, although some conventions treat any level of the constructible hierarchy as a passive mouse; its iterated ultrapowers are vacuously well-founded because there are no extenders on its sequence with which to take an ultrapower.

References

[edit | edit source]
  1. ^ T. Jech, Set Theory: The Third Millennium Edition, revised and expanded (2003). ISBN 3-540-44085-2.
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).