First-order theories of abstract dependence relations (Q1073012)

From MaRDI portal
Revision as of 18:14, 31 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128017617, #quickstatements; #temporary_batch_1722442319438)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
First-order theories of abstract dependence relations
scientific article

    Statements

    First-order theories of abstract dependence relations (English)
    0 references
    0 references
    1984
    0 references
    ''The notion of a dependence system is usually formulated in terms of a relation between points and sets which does not admit analysis by the usual logical tools. We first translate these axioms into ordinary first order terms. The main goal of this paper is to show this language allows the formulation of concepts which (a) illuminate the distinctions between dependence relations arising in different algebraic settings and (b) permit common proof of results in quite different settings where dependence relations satisfy these common properties. We provide examples in several different areas, among them stability theory, the decomposition theory of modules, matroid theory and recursive algebra.'' (from the introduction)
    0 references
    regular type
    0 references
    forking
    0 references
    dimension
    0 references
    recursive models
    0 references
    decomposition theory of modules
    0 references
    matroid theory
    0 references
    recursive algebra
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references