Modal model theory

From MaRDI portal




Abstract: We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A statement varphi is possible in a structure (written Diamondvarphi) if varphi is true in some extension of that structure, and varphi is necessary (written Boxvarphi) if it is true in all extensions of the structure. A principal case for us will be the class Mod(T) of all models of a given theory T---all graphs, all groups, all fields, or what have you---considered under the substructure relation. In this article, we aim to develop the resulting modal model theory. The class of all graphs is a particularly insightful case illustrating the remarkable power of the modal vocabulary, for the modal language of graph theory can express connectedness, k-colorability, finiteness, countability, size continuum, size aleph1, aleph2, alephomega, , first -fixed point, first -hyper-fixed-point and much more. A graph obeys the maximality principle DiamondBoxvarphi(a)ovarphi(a) with parameters if and only if it satisfies the theory of the countable random graph, and it satisfies the maximality principle for sentences if and only if it is universal for finite graphs.












This page was built for publication: Modal model theory

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