INDEPENDENCE IN GENERIC INCIDENCE STRUCTURES

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independence Structures in Set Theory1

The axioms for "independent choices" presented in van Lambalgen [1992] are strengthened here, so that they can be seen as introducing a new type of indiscernibles in set theory. The resulting system allows for the construction of natural inner models. The article is organised as follows. Section 1 introduces the axioms, some preliminary lemmas are proved and the relation with the axiom of choic...

متن کامل

Generic Structures ∗

In this paper, the theory of generic structures is put in a general, unified framework. The framework is applied to Hrushovski’s [8] universal domains and Poizat’s [11] bicoloured fields. Of particular interest will be the conditions under which generic structures are saturated.

متن کامل

Computable Structures in Generic Extensions

In this paper, we investigate connections between structures present in every generic extension of the universe V and computability theory. We introduce the notion of generic Muchnik reducibility that can be used to to compare the complexity of uncountable structures; we establish basic properties of this reducibility, and study it in the context of generic presentability, the existence of a co...

متن کامل

On Gaussian conditional independence structures

The simultaneous occurrence of conditional independences among subvectors of a regular Gaussian vector is examined. All configurations of the conditional independences within four jointly regular Gaussian variables are found and completely characterized in terms of implications involving conditional independence statements. The statements induced by the separation in any simple graph are shown ...

متن کامل

Graphical representation of independence structures

In this thesis we describe subclasses of a class of graphs with three types of edges, called loopless mixed graphs (LMGs). The class of LMGs contains almost all known classes of graphs used in the literature of graphical Markov models. We focus in particular on the subclass of ribbonless graphs (RGs), which as special cases include undirected graphs, bidirected graphs, and directed acyclic grap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Symbolic Logic

سال: 2019

ISSN: 0022-4812,1943-5886

DOI: 10.1017/jsl.2019.8