Related papers: Dependent first order theories, continued

We observe that a simple condition suffices to describes non-forking independence over models in a stable theory. Under mild assumptions, this description can be extended to non-forking independence over algebraically closed subsets,…

We extend the treatment of functional dependence, the basic concept of dependence logic, to include the possibility of dependence with a limited number of exceptions. We call this approximate dependence. The main result of the paper is a…

We extend the theory of d-separation to cases in which data instances are not independent and identically distributed. We show that applying the rules of d-separation directly to the structure of probabilistic models of relational data…

We present a framework for studying the concept of independence in a general context covering database theory, algebra and model theory as special cases. We show that well-known axioms and rules of independence for making inferences…

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

Service composition has become commonplace nowadays, in large part due to the increased complexity of software and supporting networks. Composition can be of many types, for instance sequential, prioritising, non-deterministic. However, a…

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…

The independence of the continuum hypothesis is a result of broad impact: it settles a basic question regarding the nature of N and R, two of the most familiar mathematical structures; it introduces the method of forcing that has become the…

We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…

Dependence logic, introduced in [8], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the…

The object of observation in present paper is statistical independence of real sequences and its description as independence with re spect to certain class of densities.

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…

We develop a dependent type theory that is based purely on inductive and coinductive types, and the corresponding recursion and corecursion principles. This results in a type theory with a small set of rules, while still being fairly…

The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…

We rewrite simplicially the standard definitions of a complete first order theory, a model of it, and various characterisations of stability of a complete first order theory. In our reformulations the simplicial language replaces the…

In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…