相关论文: Dependent first order theories, continued
It is shown that the independence of the continuum hypothesis points to the unique definite status of the set of intermediate cardinality: the intermediate set exists only as a subset of continuum. This latent status is a consequence of…
The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.
The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map…
We provide several crucial technical extensions of the theory of stable independence notions in accessible categories. In particular, we describe circumstances under which a stable independence notion can be transferred from a subcategory…
We show that there can be no finite list of conditional independence relations which can be used to deduce all conditional independence implications among Gaussian random variables. To do this, we construct, for each $n> 3$ a family of $n$…
We present the technique of derivation of a theory to obtain an $(n+1)f$-degrees-of-freedom theory from an $f$-degrees-of-freedom theory and show that one can calculate all of the quantities of the derived theory from those of the original…
For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…
Preferential attachment is often suggested to be the underlying mechanism of the growth of a network, largely due to that many real networks are, to a certain extent, scale-free. However, such attribution is usually made under debatable…
We study the expressive power of successor-invariant first-order logic, which is an extension of first-order logic where the usage of an additional successor relation on the structure is allowed, as long as the validity of formulas is…
Inferring the potential consequences of an unobserved event is a fundamental scientific question. To this end, Pearl's celebrated do-calculus provides a set of inference rules to derive an interventional probability from an observational…
Dependency pairs are a key concept at the core of modern automated termination provers for first-order term rewriting systems. In this paper, we introduce an extension of this technique for a large class of dependently-typed higher-order…
An important dividing line in the class of unstable theories is being NSOP$_1$, which is more general than being simple. In NSOP$_1$ theories forking independence may not be as well-behaved as in stable or simple theories, so it is replaced…
The paper gives estimations for the sizes of the the following sets: (1) the set of strings that have a given dependency with a fixed string, (2) the set of strings that are pairwise \alpha independent, (3) the set of strings that are…
We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
Non-deductive reasoning systems are often {\em representation dependent}: representing the same situation in two different ways may cause such a system to return two different answers. Some have viewed this as a significant problem. For…
Notions of freedom and independence for hypergraphs of models of a theory are defined. Properties of these notions and their applications to some natural classes of theories are studied.
We prove that if $T$ is a complete theory with weak elimination of imaginaries, then there is an explicit bijection between strict independence relations for $T$ and strict independence relations for $T^{\text{eq}}$. We use this observation…
We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories…
We introduce basic notions in category theory to type theorists, including comprehension categories, categories with attributes, contextual categories, type categories, and categories with families along with additional discussions that are…