Pointwise definable models of set theory

Journal of Symbolic Logic 78 (1):139-156 (2013)
  Copy   BIBTEX


A pointwise definable model is one in which every object is \loos definable without parameters. In a model of set theory, this property strengthens $V=\HOD$, but is not first-order expressible. Nevertheless, if \ZFC\ is consistent, then there are continuum many pointwise definable models of \ZFC. If there is a transitive model of \ZFC, then there are continuum many pointwise definable transitive models of \ZFC. What is more, every countable model of \ZFC\ has a class forcing extension that is pointwise definable. Indeed, for the main contribution of this article, every countable model of Gödel-Bernays set theory has a pointwise definable extension, in which every set and class is first-order definable without parameters



    Upload a copy of this work     Papers currently archived: 74,662

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Pointwise Definable Substructures of Models of Peano Arithmetic.Roman Murawski - 1988 - Notre Dame Journal of Formal Logic 29 (3):295-308.
Ranking Functions and Rankings on Languages.Franz Huber - 2006 - Artificial Intelligence 170 (4-5):462-471.
On the Type-Definability of the Binding Group in Simple Theories.Bradd Hart & Ziv Shami - 2005 - Journal of Symbolic Logic 70 (2):379 - 388.
Leibnizian Models of Set Theory.Ali Enayat - 2004 - Journal of Symbolic Logic 69 (3):775-789.
Isomorphisms and Nonisomorphisms of Graph Models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
A Brief Introduction to Algebraic Set Theory.Steve Awodey - 2008 - Bulletin of Symbolic Logic 14 (3):281-298.
The Complexity of the Core Model.William J. Mitchell - 1998 - Journal of Symbolic Logic 63 (4):1393-1398.


Added to PP

51 (#228,695)

6 months
4 (#172,905)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Joel David Hamkins
Oxford University

Citations of this work

Algebraicity and Implicit Definability in Set Theory.Joel David Hamkins & Cole Leahy - 2016 - Notre Dame Journal of Formal Logic 57 (3):431-439.
Ehrenfeucht’s Lemma in Set Theory.Gunter Fuchs, Victoria Gitman & Joel David Hamkins - 2018 - Notre Dame Journal of Formal Logic 59 (3):355-370.
Typicality À la Russell in Set Theory.Athanassios Tzouvaras - 2022 - Notre Dame Journal of Formal Logic 63 (2).

View all 6 citations / Add more citations

References found in this work

[Omnibus Review].Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.
Set Theory.Keith J. Devlin - 1981 - Journal of Symbolic Logic 46 (4):876-877.
The Ground Axiom.Jonas Reitz - 2007 - Journal of Symbolic Logic 72 (4):1299 - 1317.
Models of Set Theory with Definable Ordinals.Ali Enayat - 2005 - Archive for Mathematical Logic 44 (3):363-385.

View all 6 references / Add more references