When are two scientific theories "the same theory in different words"? Philosophers of science have used two formal criteria. Definitional equivalence (Glymour) is strict: it requires a common definitional extension and therefore cannot relate theories with different numbers of sorts. Categorical equivalence (Halvorson, Weatherall) is liberal: it asks only that the categories of models be equivalent. It has been applied to classical mechanics, electromagnetism and Newtonian gravitation (Weatherall 2016; survey in Weatherall 2019).
Barrett and Halvorson (2016) proposed Morita equivalence as a syntactic criterion between these two. It allows definitions of new sorts (products, coproducts, subsorts, quotients) in addition to the usual definitions of new predicates and function symbols. Their main results place the new criterion strictly between the other two:
This mission formalizes that comparison: the semantic core of Morita extensions, the implication, the separating example, and the paper's motivating "two kinds of things" example.
A signature (Sig) consists of a type of sorts, function symbols and predicate symbols . Formulas (Formula L Γ) are built in a typed context from , , predicates, and . A structure (Str) assigns a nonempty set to each sort and interprets the symbols. A theory is a set of formulas in context, each read as its universal closure; a model of is a structure satisfying them all.
The category (Model T) has the models of as objects and elementary embeddings as arrows: maps on every sort that preserve and reflect every formula. Theories are categorically equivalent (CategoricallyEquivalent) if .
A Morita extension of a -theory (MoritaData L T) adds to :
Each new symbol gets one defining axiom, and the symbols of one new sort share a single axiom. The extension (D.ext) is together with these axioms. Each definition must satisfy its admissibility condition in every model of :
| Definition | Condition |
|---|---|
| subsort | |
| quotient | is an equivalence relation |
| function symbol |
The reduct gives a functor (D.proj).
and are Morita equivalent (MoritaEquivalent) if two finite chains of Morita extensions and (MoritaReach) end in logically equivalent theories, that is, theories with the same models, over a common signature.
Milestones 1–3 together say that is an equivalence of categories. Milestones 6–8 are not needed for the goal; they record the paper's examples, which show that Morita equivalence relates theories with different numbers of sorts and is strictly stronger than categorical equivalence.
The result itself. The goal makes Morita equivalence a syntactic sufficient condition for categorical equivalence: an explicit dictionary of definitions yields an equivalence of model categories. Milestone 8 shows the converse fails, so categorical equivalence is strictly weaker. Milestone 6 shows that Morita equivalence, unlike definitional equivalence, can relate theories with different numbers of sorts. Together these locate the criterion that later philosophy-of-physics work uses to compare formulations with different ontologies, such as different numbers of kinds of objects.
Formalizing it. The results are proved on paper and, as far as is known, have no machine-checked proofs. Mathlib's ModelTheory library is single-sorted, so none of this is available there. The mission produces a reusable many-sorted first-order logic with:
The paper's arguments for conservativity and translation are informal in places; for example, the translation in the appendix uses coding of new-sorted variables. A formal proof fixes these details.
The obvious route to the goal composes the reduct functors along the chains. The work lies in showing that each reduct is an equivalence when the arrows are elementary embeddings.
For Milestone 8 the difficulty is reversed. One must rule out every pair of chains, including chains that introduce arbitrary new sorts. The paper's proof argues with a single common Morita extension. The definition, however, allows chains, and the paper notes that a chain need not collapse to a single extension. The argument must therefore be run through conservativity and translation along each chain.
Fin m → Srt). Terms and formulas use de Bruijn variables in typed contexts Γ : Fin n → Srt; Formula.all binds variable 0.Set (Axiom L), each axiom being a formula in context read as its universal closure. Because sorts are nonempty, this agrees with the sentence version.MoritaData L T lists the new sorts and symbols and their defining -formulas. The signature (D.sig) and the axioms are generated from it, and admissibility is stated semantically, over all models of . Any Morita extension in the paper's sense is of this form up to renaming of the new symbols.MoritaEquivalent asks for a bijective signature map F between the two chain ends such that a structure is a model of iff its F-reduct is a model of .Type.A complete development will need:
These pieces are reusable for any later work on interpretations or theoretical equivalence. Alternative proofs of Milestone 8, for example by counting finitely axiomatized subtheories, are welcome.
namespace MoritaEquiv
/-- Barrett–Halvorson, Theorem 5.1: Morita equivalence entails categorical equivalence,
i.e. Morita equivalent theories have equivalent categories of models
(arrows: elementary embeddings). -/
theorem morita_imp_categorical {L₁ L₂ : Sig} (T₁ : Theory L₁) (T₂ : Theory L₂)
(h : MoritaEquivalent T₁ T₂) : CategoricallyEquivalent T₁ T₂ := by sorry
end MoritaEquivIf two many-sorted first-order theories are Morita equivalent (finite chains of Morita extensions ending in logically equivalent theories over a common signature, up to renaming), then , with elementary embeddings as arrows.
No open leaves. Every sub-goal is proved or awaiting decomposition.