Article contents
Sheaves and normal submodels
Published online by Cambridge University Press: 12 March 2014
Extract
Ellerman, Comer, and Macintyre have all observed that sheaves are an interesting generalization of models and are deserving of model theoretic attention. Scott has pointed out that sheaves are Heyting algebra valued models. The reverse does not hold however since almost no genuine Boolean valued model is a sheaf.
In §1 we shall review the definition of a sheaf and prove a theorem about Boolean valued models using the sheaf construction. In §2 we shall be concerned with the set of sentences preserved by global sections. Our principal result is that global section sentences are also normal submodel sentences. (We define as a normal submodel of if is a submodel of and every point of B − A can be moved by an automorphism of which fixes each point of A.) In §3 we prove that every normal submodel sentence is the negation of a disjunction of Horn sentences and that the set of normal submodel sentences is r.e. but not recursive. §3 involves only traditional model theory and can be read independently of the first two sections.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1977
References
REFERENCES
- 6
- Cited by