Related papers: Inner-model reflection principles
We present a perception in reflection paradigm designed to transcend the limitations of current large vision-language models (LVLMs), which are expected yet often fail to achieve perfect perception initially. Specifically, we propose…
We use modular invariance and crossing symmetry of conformal field theory to reveal approximate reflection symmetries in the spectral decompositions of the partition function in two dimensions in the limit of large central charge and of the…
A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…
To be compatible with general relativity, every fundamental theory should be invariant under general coordinate transformations including spatial reflection. This paper describes an extension of the standard model in which the action is…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…
The construction of consistent effective field theories in the infrared demands that models be defined by their underlying gauge symmetries, rather than by an arbitrary tuning of couplings or a cherry-picking of operators which may not be…
Self-reflection -- the ability of a large language model (LLM) to revisit, evaluate, and revise its own reasoning -- has recently emerged as a powerful behavior enabled by reinforcement learning with verifiable rewards (RLVR). While…
By a classical theorem of Harvey Friedman (1973), every countable nonstandard model $\mathcal{M}$ of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding $j$, i.e., $j$ is a self-embedding of $\mathcal{M}$ such that…
Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability for models of fragments of ${\rm ZFC}$,…
We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…
The Model Hypothesis (abbreviated $\mathsf{MH}$) and $\Delta$ are set-theoretic axioms introduced by J. Roitman in her work on the box product problem. Answering some questions of Roitman and Williams on these two principles, we show (1)…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
We are concerned with describing the structure of the set of points in the unit interval which, when subjected to rotation by irrational alpha modulo one, for all finite portions of the orbit contain at least as many points in the bottom…
It is widely believed that complex machine learning models generally encode features through linear representations. This is the foundational hypothesis behind a vast body of work on interpretability. A key challenge toward extracting…
We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…
Reasoning models have attracted increasing attention for their ability to tackle complex tasks, embodying the System II (slow thinking) paradigm in contrast to System I (fast, intuitive responses). Yet a key question remains: Does slower…
We continue [Sh:b, Ch XIII] and [Sh:410]. Let W be an inner model of ZFC. Let kappa be a cardinal in V. We say that kappa-covering holds between V and W iff for all X in V with X subseteq ON and V models |X|< kappa, there exists Y in W such…
After reviewing various natural bi-interpretations in urelement set theory, including second-order set theories with urelements, we explore the strength of second-order reflection in these contexts. Ultimately, we prove, second-order…
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we…