The existence of arbitrary cohomological localizations on the homotopy category of spaces has remained unproved since Bousfield settled the same problem for homology theories in the decade of 1970. This is related with another open question, namely whether or not every homotopy idempotent functor on spaces is an f-localization for some map f. We prove that both questions have an affirmative answer assuming the validity of a suitable large-cardinal axiom from set theory (Vopěnka’s principle). We also show that it is impossible to prove that all homotopy idempotent functors are f-localizations using the ordinary ZFC axioms of set theory (Zermelo–Fraenkel axioms with the axiom of choice), since a counterexample can be displayed under the assumption that all cardinals are nonmeasurable, which is consistent with ZFC.

this paper, so we leave them out here. Thus we can apply the idea of combining things via colimits to institutions themselves, with the special point that we have to take limits here instead of colimits. Taking limits in CAT results in categories of "amalgamated objects", i. e. we put signatures and models together at the level of single objects. In contrast to this, sentences are combined with colimits in Set (due to the contravariant direction of the sentence component). That is, sets of sentences are combined. To show how this works, we introduce some well-known institutions and morphisms between them.

Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work, we extend development graphs with hiding (e.g. hidden operations). Hiding is a particularly difficult to realize operation, since it does not admit such a good decomposition of the involved specifications as other structuring operations do. We develop both a semantics and proof rules for development graphs with hiding. The rules are proven to be sound, and also complete relative to an oracle for conservative extensions. We also show that an absolute complete set of rules cannot exist. The whole framework is developed in a way independent of the underlying logical system (and thus also does not prescribe the nature of the parts of a specification that may be hidden).

Weak factorization systems, important in homotopy theory, are related to injective objects in comma{categories. Our main result is that full functors and topological functors form a weak factorization system in the category of small categories, and that this is not cobrantly generated. We also present a weak factorization system on the category of posets which is not cobrantly generated. No such weak factorization systems were known until recently. This answers an open problem posed by M. Hovey.

Abstract not found

Abstract. An intrinsic, combinatorial homotopy theory has been developed in [G3] for simplicial complexes; these form the cartesian closed subcategory of simple presheaves in!Smp, the topos of symmetric simplicial sets, or presheaves on the category!å of finite, positive cardinals. We show here how this homotopy theory can be extended to the topos itself,!Smp. As a crucial advantage, the fundamental groupoid Π1:!Smp = Gpd is left adjoint to a natural functor M1: Gpd =!Smp, the symmetric nerve of a groupoid, and preserves all colimits – a strong van Kampen property. Similar results hold in all higher dimensions. Analogously, a notion of (non-reversible) directed homotopy can be developed in the ordinary simplicial topos Smp, with applications to image analysis as in [G3]. We have now a homotopy n-category functor ↑Πn: Smp = n-Cat, left adjoint to a nerve Nn = n-Cat(↑Πn(∆[n]), –). This construction can be applied to various presheaf categories; the basic requirements seem to be: finite products of representables are finitely presentable and there is a representable 'standard interval'.

SAUNDERS MAC LANE has drawn attention many times, particularly in his book Mathematics: Form and Function, to the system ZBQC of set theory of which the axioms are Extensionality, Null Set, Pairing,

We say that a model category is left-determined if the weak equivalences are generated (in a sense specified below) by the cofibrations. While the model category of simplicial sets is not left-determined, we show that its non-oriented variant, the category of symmetric simplicial sets (in the sense of Lawvere and Grandis) carries a natural left-determined model category structure. This is used to give another and, as we believe simpler, proof of a recent result of D. Dugger about universal homotopy theories. 1

In particular, a new approach of dihomotopy involving simplicial presheaves over an appropriate small category is proposed. This small category is obtained by taking a full subcategory of a locally presentable

Abstract not found