id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
7h149p3100m	Sarah Cotter	Characterizing forking in VC-minimal theories	2012		.txt	text/plain	139	4	17	Finally, after introducing a slight generalization of the classical notions of forking and dividing, we prove that in any VC-minimal or quasi-VC-minimal theory whose generating family is unpackable or almost unpackable, forking of formulae over a model M is equivalent to containment in a global M -definable type, generalizing a result of Dolich on o-minimal theories in [8]. After covering some basic results, including a notion of generic types, we consider two kinds of VC-minimal theories: those whose generating directed families are unpackable and almost unpackable.	cache/7h149p3100m.txt	txt/7h149p3100m.txt