Related papers: Omitting Types and the Baire Category Theorem

Hierarchies of conditional beliefs (Battigalli and Siniscalchi 1999) play a central role for the epistemic analysis of solution concepts in sequential games. They are modelled by type structures, which allow the analyst to represent the…

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

A simply connected topological space X has homotopy Lie algebra $\pi_*(\Omega X) \tensor \Q$. Following Quillen, there is a connected differential graded free Lie algebra (dgL) called a Lie model, which determines the rational homotopy type…

We consider the Deduction Theorem used in the literature of game theory to run a purported proof by contradiction. In the context of game theory, it is stated that if we have a proof of $\phi \vdash \varphi$, then we also have a proof of…

In the Boehm theorem workshop on Crete island, Zoran Petric called Statman's ``Typical Ambiguity theorem'' typed Boehm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda…

The goal of this article is to prove the comparison theorem between algebraic and topological nearby cycles of a morphism without slopes. We prove in particular that for a family of holomorphic functions without slopes, if we iterate…

We prove Barth-type connectedness results for low-codimension smooth subvarieties with good numerical properties inside certain "easy" ambient spaces (such as homogeneous varieties, or spherical varieties). The argument employs some basics…

We prove special cases of a general conjecture: If an invertible field theory admits a projectively topological boundary theory, then it has finite order in the abelian group of invertible field theories. One can substitute `gapped' for…

Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To separate static and dynamic code, several static analyses and type systems have been…

We discuss the connections between the failure of the axiom of choice in set theory, and certain model-theoretic structures with enough symmetry.

We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…

This note extends Quillen's Theorem A to a large class of categories internal to topological spaces. This allows us to show that under a mild condition a fully faithful and essentially surjective functor between such topological categories…

Let $X$ be a topological space. Let $X_0 \subseteq X$ be a second countable subspace. Also, assume that $X$ is first countable at any point of $X_0$. Then we provide some conditions under which we ensure that $X_0$ is not Baire.

We propose to use orthologic as the basis for designing type systems supporting intersection, union, and negation types in the presence of subtyping assumptions. We show how to extend orthologic to support monotonic and antimonotonic…

We give a new characterization of $SOP$ (the strict order property) in terms of the behaviour of formulas in any model of the theory as opposed to having to look at the behaviour of indiscernible sequences inside saturated ones. We refine a…

At the heart of intuitionistic type theory lies an intuitive semantics called the "meaning explanations"; crucially, when meaning explanations are taken as definitive for type theory, the core notion is no longer "proof" but "verification".…

In the setting of constructive pointfree topology, we introduce a notion of continuous operation between pointfree topologies and the corresponding principle of pointfree continuity. An operation between points of pointfree topologies is…

We prove group existence and structure theorems in a general setting of tame topological theories. More precisely, we identify a linear/non-linear dividing line -- called topological 1-basedness -- among the class of t-minimal theories with…

This is an introduction to the study of abstract homotopy theory by means of model categories and $(\infty,1)$-categories. The only prerequisites are very basic general topology and abstract algebra. None categorical background is needed.…

A common framework is provided that comprises classical ordinal item response models as the cumulative, sequential and adjacent categories models as well as nominal response models and item response tree models. The taxonomy is based on the…