- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
On generically stable types in dependent theories
Journal of Symbolic Logic 74 (1):216-250 (2009)
Add citations
You must login to add citations.
|
|
|
We develop the theory of domination by stable types and stable weight in an arbitrary theory. |
|
|
We construct a nontrivial definable type V field topology on any dp-minimal field K that is not strongly minimal, and prove that definable subsets of Kn have small boundary. Using this topology and... |
|
|
In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of “generic stability” in arbitrary theories. Among other things, we show that the standard definition of generic stability for types coincides with the notion of a frequency interpretation measure. We also give combinatorial examples of types in NSOP theories that are finitely approximated but not generically stable, as well as ϕ-types in simple theories that are definable and finitely satisfiable in a small (...) |
|
|
We prove that in $\operatorname {NTP}_{\operatorname {2}}$ theories the dp-rank of a type can be witnessed by indiscernible sequences of tuples satisfying that type. If the type has dp-rank infinity, then this can be witnessed by singletons. |
|
|
We prove that any left-ordered inp-minimal group is abelian and we provide an example of a non-abelian left-ordered group of dp-rank 2. Furthermore, we establish a necessary condition for a group to have finite burden involving normalizers of definable sets, reminiscent of other chain conditions for stable groups. |
|
|
We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular, it follows from our investigation that in resilient theories strict non-forking is symmetric. Based on this study, we develop notions of weight which characterize NTP2, dependence and strong dependence. Many of our proofs rely on careful analysis of sequences that witness dividing. We prove simple characterizations of such sequences in resilient theories, as well as of Morley sequences which are (...) |
|
|
For a first-order formula φ(x; y) we introduce and study the characteristic sequence ⟨P n : n < ω⟩ of hypergraphs defined by P n (y₁…., y n ):= $(\exists x)\bigwedge _{i\leq n}\varphi (x;y_{i})$ . We show that combinatorial and classification theoretic properties of the characteristic sequence reflect classification theoretic properties of φ and vice versa. The main results are a characterization of NIP and of simplicity in terms of persistence of configurations in the characteristic sequence. Specifically, we show that (...) |
|
|
In this paper, we prove the following:Theorem. Let M be a rosy dependent theory and letp,pbe non-þ-forking extensions ofp∈Switha0a1; assume thatp∪pis consistent and thata0,a1start a þ-independent indiscernible sequence. Thenp∪pis a non-þ-forking extension ofp.We also provide an example to show that the result is not true without assuming NIP. |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6f97f49787-4dlf6 uwo