{'fraction_non_alphanumeric': 0.025280898876404494, 'fraction_numerical': 0.0, 'mean_word_length': 4.189320388349515, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
DEFINABILITY OF SATISFACTION IN OUTER MODELS

Abstract Let M be a transitive model of ZFC. We say that a transitive model of ZFC, N, is an outer model of M if M ⊆ N and ORD ∩ M = ORD ∩ N. The outer model theory of M is the collection of all formulas with parameters from M which hold in all outer models of M (which exist in a universe in which M is countable; this is independent of the choice of such a universe). Satisfaction defined with respect to outer models can be seen as a useful strengthening of first-order logic. Starting from an inaccessible cardinal κ, we show that it is consistent to have a transitive model M of ZFC of size κ in which the outer model theory is lightface definable, and moreover M satisfies V = HOD. The proof combines the infinitary logic L ∞,ω , Barwise’s results on admissible sets, and a new forcing iteration of length strictly less than κ + which manipulates the continuum function on certain regular cardinals below κ. In the appendix, we review some unpublished results of Mack Stanley which are directly related to our topic.