Ehrenfeucht's lemma in set theory
Gunter Fuchs, Victoria Gitman, Joel David Hamkins

TL;DR
This paper explores the validity of Ehrenfeucht's lemma in set theory models, showing it holds in models where V=HOD but can fail otherwise, and introduces generalized principles and algebraic analogues.
Contribution
It extends Ehrenfeucht's lemma to set theory, analyzes its limitations in models with V≠HOD, and introduces parametric and algebraic generalizations.
Findings
Ehrenfeucht's lemma holds in models with V=HOD.
The lemma can fail in models with V≠HOD and after Cohen forcing.
Algebraicity and definability do not always coincide in models of set theory.
Abstract
Ehrenfeucht's lemma (1973) asserts that whenever one element of a model of Peano arithmetic is definable from another, then they satisfy different types. We consider here the analogue of Ehrenfeucht's lemma for models of set theory. The original argument applies directly to the ordinal-definable elements of any model of set theory, and in particular, Ehrenfeucht's lemma holds fully for models of set theory satisfying . We show that the lemma can fail, however, in models of set theory with , and it necessarily fails in the forcing extension to add a generic Cohen real. We go on to formulate a scheme of natural parametric generalizations of Ehrenfeucht's lemma, namely, the principles of the form , which asserts that whenever an object is definable from some using parameters in , with , then the types of and over are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
