Sciweavers

76 search results - page 1 / 16
» Stable definability and generic relations
Sort
View
JSYML
2007
75views more  JSYML 2007»
13 years 5 months ago
Stable definability and generic relations
Abstract. An amalgamation base p in a simple theory is stably definable if its canonical base is interdefinable with the set of canonical parameters for the φ-definitions of p ...
Byunghan Kim, Rahim Moosa
CALCO
2009
Springer
146views Mathematics» more  CALCO 2009»
13 years 12 months ago
Non-strongly Stable Orders Also Define Interesting Simulation Relations
Ignacio Fábregas, David de Frutos-Escrig, M...
IANDC
2006
78views more  IANDC 2006»
13 years 5 months ago
A stable programming language
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
Luca Paolini
APAL
2000
84views more  APAL 2000»
13 years 5 months ago
Strong Splitting in Stable Homogeneous Models
In this paper we study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in [Hy]. We apply this to prove a structure theorem. We...
Tapani Hyttinen, Saharon Shelah
JSYML
2006
85views more  JSYML 2006»
13 years 5 months ago
On PAC and bounded substructures of a stable structure
We introduce and study the notions of a PAC substructure of a stable structure, and a bounded substructure of an arbitrary substructure, generalizing [8]. We give precise definiti...
Anand Pillay, Dominika Polkowska