Theories of presheaf type
نویسنده
چکیده
Let us say that a geometric theory T is of presheaf type if its classifying topos B[T ] is (equivalent to) a presheaf topos. (We adhere to the convention that geometric logic allows arbitrary disjunctions, while coherent logic means geometric and finitary.) Write Mod(T ) for the category of Set-models and homomorphisms of T . The next proposition is well known; see, for example, MacLane–Moerdijk [13], pp. 381-386, and the textbook of Adámek– Rosický [1] for additional information: Proposition 0.1. For a category M, the following properties are equivalent:
منابع مشابه
Syntactic Characterizations of Properties of Classifying Toposes
We give characterizations, for various fragments of geometric logic, of the class of theories classified by a locally connected (respectively connected and locally connected, atomic, compact, presheaf) topos, and exploit the existence of multiple sites of definition for a given topos to establish various results on quotients of theories of presheaf type.
متن کاملThe Landweber Exact Functor Theorem, Stacks, and the Presheaf of Elliptic Homology Theories
The goal of this chapter is the construction of the presheaf of elliptic homology theories on the moduli stack of elliptic curves Mell . This sets the stage for many of the later chapters where the objective will be to turn this presheaf into to a sheaf of E∞-ring spectra (using obstruction theory). Even though we use the language of stacks, much of this chapter is closely related to the classi...
متن کاملCombinatorial structure of type dependency
Article history: Received 7 June 2014 Available online 16 October 2014 Communicated by G. Rosolini MSC: 03B15; 03G30 We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of generalised algebraic theories in the sense of Cartmell, and exhibiting it as the category of algebras for a monad on a presheaf category. The...
متن کاملNew-HOPLA: A Higher-order Process Language with Name Generation
This paper introduces new-HOPLA, a concise but powerful language for higher-order nondeterministic processes with name generation. Its origins as a metalan-guage for domain theory are sketched but for the most part the paper concentrateson its operational semantics. The language is typed, the type of a process describingthe shape of the computation paths it can perform. Its ...
متن کاملPresheaf Models for Constructive Set Theories
We introduce a new kind of models for constructive set theories based on categories of presheaves. These models are a counterpart of the presheaf models for intuitionistic set theories defined by Dana Scott in the ’80s. We also show how presheaf models fit into the framework of Algebraic Set Theory and sketch an application to an independence result. 1. Variable sets in foundations and practice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 69 شماره
صفحات -
تاریخ انتشار 2004