- New
-
Topics
- 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
- Journals
- Submit material
- More
Switch to: References
Add citations
You must login to add citations.
|
|
|
We give some sufficient conditions for a predicate P in a complete theory T to be "stably embedded". Let P be P with its "induced θ-definable structure". The conditions are that P (or rather its theory) is "rosy", P has NIP in T and that P is stably 1-embedded in T. This generalizes a recent result of Hasson and Onshuus [6] which deals with the case where P is o-minimal in T. Our proofs make use of the theory of strict (...) |
|
|
|
|
|
In this note we prove and disprove some chain conditions in type definable and definable groups in dependent, strongly dependent and strongly2 dependent theories. |
|
|
A theory $T$ is shown to have an ICT pattern of depth $k$ in $n$ variables iff it interprets some $k$ -maximum VC class in $n$ parameters. |
|
|
|
|
|
We study the notion of dp-minimality, beginning by providing several essential facts about dp-minimality, establishing several equivalent definitions for dp-minimality, and comparing dp-minimality to other minimality notions. The majority of the rest of the paper is dedicated to examples. We establish via a simple proof that any weakly o-minimal theory is dp-minimal and then give an example of a weakly o-minimal group not obtained by adding traces of externally definable sets. Next we give an example of a divisible ordered Abelian (...) |
|
|
We consider VC-minimal theories admitting unpackable generating families, and show that in such theories, forking of formulae over a model M is equivalent to containment in global types definable over M, generalizing a result of Dolich on o-minimal theories in [4]. |
|
|
We initiate a systematic study of the class of theories without the tree property of the second kind — NTP2. Most importantly, we show: the burden is “sub-multiplicative” in arbitrary theories ; NTP2 is equivalent to the generalized Kimʼs lemma and to the boundedness of ist-weight; the dp-rank of a type in an arbitrary theory is witnessed by mutually indiscernible sequences of realizations of the type, after adding some parameters — so the dp-rank of a 1-type in any theory is (...) |
|
|
In this article, we develop and clarify some of the basic combinatorial properties of the new notion of n-dependence recently introduced by Shelah. In the same way as dependence of a theory means its inability to encode a bipartite random graph with a definable edge relation, n-dependence corresponds to the inability to encode a random -partite -hypergraph with a definable edge relation. We characterize n-dependence by counting φ-types over finite sets, and in terms of the collapse of random ordered -hypergraph (...) |
|
|
We study the notion of weak one-basedness introduced in recent work of Berenstein and Vassiliev. Our main results are that this notion characterizes linearity in the setting of geometric þ-rank 1structures and that lovely pairs of weakly one-based geometric þ-rank 1 structures are weakly one-based with respect to þ-independence. We also study geometries arising from infinite-dimensional vector spaces over division rings. |
|
|
We consider valued fields with a distinguished isometry or contractive derivation as valued modules over the Ore ring of difference operators. Under certain assumptions on the residue field, we prove quantifier elimination first in the pure module language, then in that language augmented with a chain of additive subgroups, and finally in a two-sorted language with a valuation map. We apply quantifier elimination to prove that these structures do not have the independence property. |
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-7c76586df8-l2pxr uwo