# Geometry of forking in simple theories

@article{Peretz2006GeometryOF, title={Geometry of forking in simple theories}, author={Assaf Peretz}, journal={Journal of Symbolic Logic}, year={2006}, volume={71}, pages={347 - 360} }

Abstract We investigate the geometry of forking for SU-rank 2 elements in supersimple ω-categorical theories and prove stable forking and some structural properties for such elements. We extend this analysis to the case of SU-rank 3 elements.

#### Topics from this paper

#### 7 Citations

ANOTHER LOOK AT STABLE FORKING IN 1-BASED SUPERSIMPLE THEORIES

- 2011

We give two alternative proofs that 1-based theories of finite SU-rank have stable forking, neither of which seems to require the full power of elimination of hyperimaginaries. We also show some… Expand

Stable Forking and Imaginaries

- Mathematics, Computer Science
- Notre Dame J. Formal Log.
- 2018

We prove that a theory $T$ has stable forking if and only if $T^\mathrm{eq}$ has stable forking.

Omega-categorical simple theories

- Mathematics
- 2013

This thesis touches on many different aspects of homogeneous relational structures. We start with an introductory chapter in which we present all the background from model theory and homogeneity… Expand

On Weak Elimination of Hyperimaginaries and its Consequences

- Mathematics
- 2012

We analyze the notion of weak elimination of hyperimaginaries (WEHI) in simple theories. A key observation in the analysis is a characterization of WEHI in terms of forking dependence -- a condition… Expand

What Simplicity Is Not

- Computer Science
- 2017

Hilbert’s 24th problem, and a mathematical concept of simplicity of a proof, are investigated, with both sides focused on what simplicity is not. Expand

Forking in simple theories and CM-triviality

- Philosophy
- 2012

Aquesta tesi te tres objectius. En primer lloc, estudiem generalitzacions de la jerarquia no ample relatives a una familia de tipus parcials. Aquestes jerarquies en permeten classificar la… Expand

#### References

SHOWING 1-7 OF 7 REFERENCES

Simplicity, and stability in there

- Computer Science, Mathematics
- Journal of Symbolic Logic
- 2001

It is proved that the equivalence of simplicity and the symmetry of forking is equal, and the same is true with stable formulas for an 1-based theory having elimination of hyperimaginaries. Expand

Simple unstable theories

- Mathematics
- 1980

Abstract We point out a class of unstable theories which are simple, and develop for them an analog to the basic theorems on stable theories.

Simple Theories

- Computer Science
- Ann. Pure Appl. Log.
- 1997

This paper succeeds in proving the Independence Theorem over a model for simple theories by proving that any theory equipped with a notion of independence satisfying all the basic algebraic axioms must be simple, and that moreover the notion ofindependence must coincide with nonforking. Expand

Around stable forking

- Mathematics
- 2001

In the past few years various conjectures have been made concerning therelationship between simple theories and stable theories. The general thrustis that in a simple theory T forking should be… Expand

Classification theory

- North-Holland, Amsterdam
- 1978

Investigations into the geometry of forking in simple theories

- Ph.D. thesis, UC Berekeley
- 2003