Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T04:32:10.531Z Has data issue: false hasContentIssue false

Stability theory for topological logic, with applications to topological modules1

Published online by Cambridge University Press:  12 March 2014

T. G. Kucera*
Affiliation:
Department of Mathematics, University of Saskatchewan, Saskatoon, Saskatchewan S7N 0W0, Canada

Extract

In this paper I show how to develop stability theory within the context of the topological logic first introduced by McKee [Mc 76], Garavaglia [G 78] and Ziegler [Z 76]. I then study some specific applications to topological modules; in particular I prove two quantifier élimination theorems, one a generalization of a result of Garavaglia.

In the first section I present a summary of basic results on topological model theory, mostly taken from the book of Flum and Ziegler [FZ 80]. This is done primarily to fix notation, but I also introduce the notion of an Lt-elementary substructure. The important point with this concept, as with many others, appears to be to allow only individuals to appear as parameters, not open sets.

In the second section I begin the study of stability theory for Lt. I first develop a translation of the topological language Lt into an ordinary first-order language L*. The first main theorem is (2.3), which shows that the translation is faithful to the model-theoretic content of Lt, and provides the necessary tools for studying Lt theories in the context of ordinary first-order logic. The translation allows me to consider individual stability theory for Lt: the stability-theoretic study of those types of Lt in which only individual variables occur freely and in which only individuals occur as parameters. I originally developed this stability theory entirely within Lt; the fact that the theorems and their proofs were virtually identical to those in ordinary first order logic suggested the reduction from Lt to L*.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1986

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable