Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T00:26:14.925Z Has data issue: false hasContentIssue false

Stable definability and generic relations

Published online by Cambridge University Press:  12 March 2014

Byunghan Kim
Affiliation:
Yonsei University, Department of Mathematics, 134 Shinchon-Dong, Seodaemun-Gu Seoul 120-749, Korea. E-mail: bkim@yonsei.ac.kr
Rahim Moosa
Affiliation:
University of Waterloo, Department of Pure Mathematics 200 University Avenue West Waterloo, Ontario N2L 3G1, Canada. E-mail: rmoosa@math.uwaterloo.ca

Abstract

An amalgamation base p in a simple theory is stably definable if its canonical base is interde-finable with the set of canonical parameters for the ϕ-definitions of p as ϕ ranges through all stable formulae. A necessary condition for stably definability is given and used to produce an example of a supersimple theory with stable forking having types that are not stably definable. This answers negatively a question posed in [8]. A criterion for and example of a stably definable amalgamation base whose restriction to the canonical base is not axiomatised by stable formulae are also given. The examples involve generic relations over non CM-trivial stable theories.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable