Translator Disclaimer
2017 Forking and Dividing in Henson Graphs
Gabriel Conant
Notre Dame J. Formal Logic 58(4): 555-566 (2017). DOI: 10.1215/00294527-2017-0016

Abstract

For n3, define Tn to be the theory of the generic Kn-free graph, where Kn is the complete graph on n vertices. We prove a graph-theoretic characterization of dividing in Tn and use it to show that forking and dividing are the same for complete types. We then give an example of a forking and nondividing formula. Altogether, Tn provides a counterexample to a question of Chernikov and Kaplan.

Citation

Download Citation

Gabriel Conant. "Forking and Dividing in Henson Graphs." Notre Dame J. Formal Logic 58 (4) 555 - 566, 2017. https://doi.org/10.1215/00294527-2017-0016

Information

Received: 23 July 2014; Accepted: 10 July 2015; Published: 2017
First available in Project Euclid: 6 June 2017

zbMATH: 06803187
MathSciNet: MR3707651
Digital Object Identifier: 10.1215/00294527-2017-0016

Subjects:
Primary: 03C45
Secondary: 03C68

Rights: Copyright © 2017 University of Notre Dame

JOURNAL ARTICLE
12 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.58 • No. 4 • 2017
Back to Top