Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T17:04:56.925Z Has data issue: false hasContentIssue false

Sheaves and normal submodels

Published online by Cambridge University Press:  12 March 2014

Richard Mansfield*
Affiliation:
Pennsylvania State University, University Park, PA 16802

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 ofB − 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1977

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