Around stable forking

Byunghan Kim; A. Pillay

Fundamenta Mathematicae (2001)

  • Volume: 170, Issue: 1-2, page 107-118
  • ISSN: 0016-2736

Abstract

top
We discuss various conjectures and problems around the issue of when and whether stable formulas are responsible for forking in simple theories. We prove that if the simple theory T has strong stable forking then any complete type is a nonforking extension of a complete type which is axiomatized by instances of stable formulas. We also give another treatment of the first author's result which identifies canonical bases in supersimple theories.

How to cite

top

Byunghan Kim, and A. Pillay. "Around stable forking." Fundamenta Mathematicae 170.1-2 (2001): 107-118. <http://eudml.org/doc/282208>.

@article{ByunghanKim2001,
abstract = {We discuss various conjectures and problems around the issue of when and whether stable formulas are responsible for forking in simple theories. We prove that if the simple theory T has strong stable forking then any complete type is a nonforking extension of a complete type which is axiomatized by instances of stable formulas. We also give another treatment of the first author's result which identifies canonical bases in supersimple theories.},
author = {Byunghan Kim, A. Pillay},
journal = {Fundamenta Mathematicae},
keywords = {stable formulas; forking; simple theories; complete type; nonforking extension; canonical bases; supersimple theories},
language = {eng},
number = {1-2},
pages = {107-118},
title = {Around stable forking},
url = {http://eudml.org/doc/282208},
volume = {170},
year = {2001},
}

TY - JOUR
AU - Byunghan Kim
AU - A. Pillay
TI - Around stable forking
JO - Fundamenta Mathematicae
PY - 2001
VL - 170
IS - 1-2
SP - 107
EP - 118
AB - We discuss various conjectures and problems around the issue of when and whether stable formulas are responsible for forking in simple theories. We prove that if the simple theory T has strong stable forking then any complete type is a nonforking extension of a complete type which is axiomatized by instances of stable formulas. We also give another treatment of the first author's result which identifies canonical bases in supersimple theories.
LA - eng
KW - stable formulas; forking; simple theories; complete type; nonforking extension; canonical bases; supersimple theories
UR - http://eudml.org/doc/282208
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.