Get AI summaries of any video or article — Sign up free

WHEN BI-INTERPRETABILITY IMPLIES SYNONYMY

Harvey Friedman, Albert Visser
The Review of Symbolic Logic·2025·Computer Science·58 citations
7 min read

Read the full paper at DOI or on arxiv

TL;DR

The paper asks when bi-interpretability implies synonymy (definitional equivalence) rather than merely mutual interpretability.

Briefing

This paper studies a central question in model theory and the philosophy of mathematics: when are two formal theories “the same”? Two prominent notions of sameness are (i) synonymy (also called definitional equivalence), which is the strictest common notion, and (ii) bi-interpretability, which is weaker and allows the theories to interpret each other up to definable isomorphism rather than literal definitional extension.

The authors’ research question is: in what circumstances can one infer synonymy from bi-interpretability? This matters because bi-interpretability is often easier to establish and is known to preserve many structural properties (e.g., automorphism groups up to isomorphism, categoricity-like properties, finite axiomatizability). Synonymy, however, preserves more fine-grained structure—most notably, it preserves the action of automorphisms on the domain (not just the abstract automorphism group). Thus, knowing when bi-interpretability collapses to synonymy tells us when “mutual interpretability” is strong enough to guarantee genuine definitional equivalence.

The paper focuses on a special class of theories called sequential theories. Sequentiality is motivated by the presence of coding of sequences (and more generally, enough internal set-like structure to build sequences and truth predicates). Examples given include Buss’s theory , elementary arithmetic (EA/EFA), , and set theories such as ZF and ZFC. The authors also introduce a broader notion, conceptuality, which is proof-generated and is slightly more general than sequentiality; all sequential theories are conceptual, but not conversely.

Methodologically, the paper is not empirical but proof-theoretic: it develops categorical and model-theoretic machinery around interpretations, then proves a key theorem using an internal version of the Schröder–Bernstein theorem.

The core definitions are: an interpretation is given by a translation of the language of into , with a domain formula (of some dimension ) specifying which tuples in models of serve as the interpreted domain. Interpretations can be composed, and the paper distinguishes several “dimensions” and properties: one-dimensional interpretations, identity-preserving interpretations (translating identity to identity), unrelativized/direct interpretations, etc. Synonymy corresponds to isomorphism in a category of interpretations modulo “equality” (the target theory proves the interpretations coincide). Bi-interpretability corresponds to isomorphism in , where the target theory provides definable isomorphisms between the internal models produced by compositions.

The main technical ingredient is a version of the Schröder–Bernstein theorem under very weak conditions. The authors formalize this in an auxiliary theory , built from adjunctive class theory plus axioms ensuring the existence of two equivalence relations and injections between quotient classes. Concretely, has unary predicates , and binary predicates , , plus injections and between the quotient sets and . The proof constructs a definable bijection between these quotients using a “switch” argument: for each element , either there is an -switch (a certain downward-closed pair of virtual classes) or not, and the definition of chooses between and accordingly. The paper then proves within that is well-defined on equivalence classes, functional, injective, and surjective.

With this Schröder–Bernstein machinery, the main theorem is proved as follows. Suppose two theories and are bi-interpretable via interpretations and . The authors assume that the interpretations involved in the bi-interpretation are one-dimensional and identity-preserving, and that is conceptual (in particular, sequential). Under these assumptions, they show that synonymy follows.

The key conceptual step is that the bi-interpretation gives mutual “retract-like” behavior: proves that the composition yields the identity interpretation on (in the appropriate sense), while proves that yields an interpretation elementarily equivalent to the identity on . To upgrade from bi-interpretability to synonymy, they construct a direct, identity-preserving interpretation by using Schröder–Bernstein to turn definable injections between the full domain and the interpreted domain into a definable bijection. This allows them to replace the original interpretation by a direct one that is isomorphic to it, and then apply a corollary stating that if one witnessing interpretation is direct (and the other conditions hold), then synonymy results.

The paper also addresses optimality. It provides an example showing the theorem cannot be strengthened by dropping identity preservation for both interpretations: there exist two finitely axiomatized sequential theories that are bi-interpretable but not synonymous, where precisely one of the interpretations in the bi-interpretation is not identity-preserving. The example is framed as “Frege meets Cantor”: the authors define a one-sorted weak set theory (adjunctive class theory with Frege relation) and compare it to adjunctive set theory . They give explicit one-dimensional interpretations witnessing bi-interpretability between and , with one interpretation identity-preserving. They then show non-synonymy by analyzing automorphism actions on domains. Specifically, they construct a model of with an automorphism of order 2 that fixes any given finite set but has only finitely many fixed points overall. If synonymy held, the internal model of inside would be definable using only finitely many parameters , so would induce an automorphism of the internal model. They then consider classes of the form and argue that there would be infinitely many such classes fixed by by extensionality, contradicting that has only finitely many fixed points. This shows the separation between bi-interpretability and synonymy is real and tied to the identity-preserving requirement.

Limitations are primarily conceptual rather than empirical: the theorem applies to conceptual (hence sequential) theories and requires one-dimensional, identity-preserving interpretations. The authors explicitly argue optimality by giving a counterexample when identity preservation is not assumed for one of the interpretations. They also note that sequentiality is not closed under bi-interpretability in general, motivating the use of the broader conceptuality framework.

Practical implications: while the results are theoretical, they guide how logicians should interpret “sameness” claims. If you can prove bi-interpretability between sequential/conceptual theories using identity-preserving one-dimensional interpretations, then you can safely conclude synonymy, meaning definitional equivalence and preservation of domain-level automorphism action. This is important for transferring results between theories: definitional equivalence is stronger than mutual interpretability and supports more faithful translation of structures and invariants.

Who should care? Model theorists and logicians studying interpretability, definitional equivalence, and the structure of theories under translations; philosophers of mathematics concerned with what it means for theories to be “the same”; and researchers in proof theory and foundational logic who use interpretability as a tool for comparing systems (e.g., arithmetic and set theories). The paper also contributes an independently interesting Schröder–Bernstein theorem formalized under weak assumptions, which may be useful in other interpretability arguments.

Overall, the paper’s core contribution is a sharp criterion: under conceptuality and identity-preserving one-dimensional bi-interpretations, bi-interpretability collapses to synonymy, with a matching example showing the criterion is essentially tight.

Cornell Notes

The paper proves that for conceptual (in particular sequential) theories, bi-interpretability via one-dimensional identity-preserving interpretations implies synonymy (definitional equivalence). The proof relies on a weak-condition internal Schröder–Bernstein theorem that turns mutual injections into a definable bijection, and the authors show optimality by constructing a bi-interpretable but non-synonymous example when identity preservation fails for one direction.

What is the paper’s main research question?

When can synonymy (definitional equivalence) be inferred from bi-interpretability between theories?

Why does the distinction between synonymy and bi-interpretability matter?

Synonymy preserves more structure—especially the action of automorphisms on the domain—while bi-interpretability may only preserve automorphism groups up to isomorphism.

What class of theories does the main theorem target?

Conceptual theories, which include all sequential theories (theories with sufficient coding of sequences, via an internal weak set/class theory).

What properties are required of the bi-interpretation witnessing interpretations?

They must be one-dimensional and identity-preserving (at least in the direction(s) specified by the theorem’s hypotheses).

What is the key technical tool used to upgrade bi-interpretability to synonymy?

A weak-condition version of the Schröder–Bernstein theorem, formalized in an auxiliary theory , constructing a definable bijection from injections between quotient classes.

How does the Schröder–Bernstein result enter the synonymy proof?

It is used to convert definable injections between the full domain and the interpreted domain into a definable bijection, enabling construction of a direct interpretation isomorphic to the original one.

What does the main theorem conclude?

If and are bi-interpretable and the relevant interpretations are one-dimensional and identity-preserving (with conceptual), then and are synonymous.

How do the authors show the result is optimal?

They give finitely axiomatized sequential theories that are bi-interpretable but not synonymous, where exactly one witnessing interpretation fails to be identity-preserving.

What is the non-synonymy example based on?

A comparison between a Frege-style weak set theory and adjunctive set theory , using an automorphism argument to separate synonymy from bi-interpretability.

Review Questions

  1. In your own words, explain why identity preservation is the crucial strengthening needed to pass from bi-interpretability to synonymy.

  2. Describe the structure of the weak Schröder–Bernstein theorem used: what are the equivalence relations, injections, and the constructed bijection?

  3. Outline the proof strategy for the main theorem: what is the role of conceptuality and how is a direct interpretation constructed?

  4. Explain the automorphism-based argument in the optimality example: how does extensionality force infinitely many fixed classes?

  5. What would likely fail if the interpretations were not one-dimensional or not identity-preserving?

Key Points

  1. 1

    The paper asks when bi-interpretability implies synonymy (definitional equivalence) rather than merely mutual interpretability.

  2. 2

    For conceptual theories (including sequential theories), bi-interpretability via one-dimensional identity-preserving interpretations implies synonymy.

  3. 3

    The proof depends on a weak-condition internal Schröder–Bernstein theorem that constructs a definable bijection from two definable injections between quotient classes.

  4. 4

    The authors formalize the Schröder–Bernstein argument in an auxiliary theory and prove bijectivity of a constructed (well-defined, functional, injective, surjective).

  5. 5

    They show optimality by giving finitely axiomatized sequential theories that are bi-interpretable but not synonymous when identity preservation fails for one interpretation.

  6. 6

    The separation example uses an automorphism argument: synonymy would force infinitely many fixed equivalence classes, contradicting that the automorphism has only finitely many fixed points.

  7. 7

    The results clarify that bi-interpretability can preserve automorphism groups only up to isomorphism, while synonymy preserves the domain-level action—hence the need for identity preservation.

Highlights

“Suppose that two sequential theories are bi-interpretable and that the interpretations involved in the bi-interpretation are one-dimensional and identity preserving. Then, the theories are synonymous.”
“The crucial ingredient of our proof is a version of the Schröder-Bernstein theorem under very weak conditions.”
“We provide an example to show that this result is optimal. There are two finitely axiomatized sequential theories that are bi-interpretable but not synonymous, where precisely one of the interpretations involved in the bi-interpretation is not identity preserving.”
In the Schröder–Bernstein construction: is defined so that “ iff (there is no -switch and ) or (there is an -switch and ).”
Non-synonymy argument: if synonymy held, then an automorphism with only finitely many fixed points would nevertheless fix infinitely many extensional classes , yielding a contradiction.

Topics

  • Model theory
  • Interpretability logic
  • Definitional equivalence (synonymy)
  • Bi-interpretability
  • Schröder–Bernstein theorem (internal/definable versions)
  • Sequential theories and coding
  • Adjunctive class theory
  • Automorphisms and invariants under interpretations

Mentioned

  • Mizar (used to verify a proof component)
  • John Templeton Foundation (funding)
  • Mizar formalization of the Schröder–Bernstein theorem proof
  • Harvey M. Friedman
  • Albert Visser
  • Tonny Hurkens
  • Allan van Hulst
  • Freek Wiedijk
  • Leszek Kołodziejczyk
  • Tim Button
  • Wilfrid Hodges
  • Peter Aczel
  • Ali Enayat
  • Wilfrid Hodges
  • Craig Smoryński
  • Pavel Pudlák
  • Gisela Ahlbrandt
  • Martin Ziegler
  • Richard Kaye
  • Tin Lok Wong
  • Benedikt Löwe
  • Julia Robinson
  • Emil Jeřábek
  • Wanda Szmielew
  • Alfred Tarski
  • Ali Enayat
  • Mateusz Łełyk
  • AS - Adjunctive set theory (weak set theory used to define sequentiality)
  • ac - Adjunctive class theory (two-sorted theory of objects and classes)
  • SB - Auxiliary theory used to formalize the weak Schröder–Bernstein theorem
  • INT0 - Category of interpretations modulo equality (synonymy/definitional equivalence)
  • INT1 - Category of interpretations modulo i-isomorphism (bi-interpretability)
  • INT2/INT3 - Other congruence notions of sameness of interpretations (iso/elementary congruence)
  • EA - Elementary Arithmetic
  • EFA - Elementary Function Arithmetic (as referenced in examples)
  • PA - Peano Arithmetic
  • PA^- - Non-negative part of a discretely ordered commutative ring theory (as used in applications)
  • ZF - Zermelo–Fraenkel set theory
  • ZFC - ZF with Choice
  • ACF_flat - One-sorted Frege-style weak set theory variant used in the example
  • IΣ1 - Induction for \(\Sigma_1\) formulas
  • S^1_2 - Buss’s theory (as referenced in examples)