Bisimulations of potentialist systems

MaRDI QIDQ6402726zbMATH OpenFDO

Authors Sam Adam-Day

Publication date 21 June 2022

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Basic properties of first-order languages and structures (03C07) Other infinitary logic (03C75)

Abstract: A potentialist system is a first-order Kripke model based on embeddings. I define the notion of bisimulation for these systems, and provide a number of examples. Given a first-order theory $T$, the system $mathrmMod(T)$ consists of all models of $T$. We can then take either all embeddings, or all substructure inclusions, between these models. I show that these two ways of defining $mathrmMod(T)$ are bitotally bisimilar. Next, I relate the notion of bisimulation to a generalisation of the Ehrenfeucht-Fra"is'e game, and use this to show the equivalence of the existence of a bisimulation with elementary equivalence with respect to an infinitary language. Finally, I consider the question of when a potentialist system is bitotally bisimilar to a system containing set-many models, providing too different sufficient conditions.

This page was built for publication: Bisimulations of potentialist systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402726)