Related papers: Dependent dreams: recounting types
Saturation is (mu,kappa)-transferable in T if and only if there is an expansion T_1 of T with |T_1| = |T| such that if M is a mu-saturated model of T_1 and |M| \geq kappa then the reduct M|L(T) is kappa-saturated. We characterize theories…
We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabitation in an intersection type system P based on…
We present a novel dependent linear type theory in which the multiplicity of some variable-i.e., the number of times the variable can be used in a program-can depend on other variables. This allows us to give precise resource annotations to…
Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…
In this paper we prove a strong nonstructure theorem for kappa (T)-saturated models of a stable theory T with dop.
There are many results in the literature where superstablity-like independence notions, without any categoricity assumptions, have been used to show the existence of larger models. In this paper we show that \emph{stability} is enough to…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
After the main gap theorem was proved (see [Sh:c]), in discussion, Harrington expressed a desire for a finer structure - of finitary character (when we have a structure theorem at all). I point out that the logic L_{infty,aleph_0}(d.q.)…
Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…
It is shown that if T is stable unsuperstable, and aleph_1< lambda =cf(lambda)< 2^{aleph_0}, or 2^{aleph_0} < mu^+< lambda =cf(lambda)< mu^{aleph_0} then T has no universal model in cardinality lambda, and if e.g. aleph_omega < 2^{aleph_0}…
We prove that in a theory $T$ stable over a predicate $P$, for any $\lambda > |T|$, there is a $\lambda$-prime model over any complete set A with a $\lambda$-saturated $P$-part.
We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent (NIP) theories.
We study the spectrum of limit models assuming the existence of a nicely behaved independence notion. Under reasonable assumptions, we show that all `long' limit models are isomorphic, and all `short' limit models are non-isomorphic.…
We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…
We prove the following continuous analogue of Vaught's Two-Cardinal Theorem: if for some $\kappa>\lambda\geq \aleph_0$, a continuous theory $T$ has a model with density character $\kappa$ which has a definable subset of density character…
We present a type theory dealing with non-linear, "ordinary" dependent types (which we will call cartesian) and linear types, where both constructs may depend on terms of the former. In the interplay between these, we find new type formers…
We define and study a metric independence notion in a homogeneous metric abstract elementary class with perturbations that is $d^p$-superstable (superstable wrt. the perturbation topology), weakly simple and has complete type spaces and we…
We study invariant types in NIP theories. Amongst other things: we prove a definable version of the (p,q)-theorem in theories of small or medium directionality; we construct a canonical retraction from the space of M-invariant types to that…
Copulas are essential tools in statistics and probability theory, enabling the study of the dependence structure between random variables independently of their marginal distributions. Among the various types of copulas, Ratio-Type Copulas…
Denotational models of type theory, such as set-theoretic, domain-theoretic, or category-theoretic models use (actual) infinite sets of objects in one way or another. The potential infinite, seen as an extensible finite, requires a dynamic…