Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic (Q598270)

From MaRDI portal
Revision as of 08:49, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic
scientific article

    Statements

    Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic (English)
    0 references
    0 references
    6 August 2004
    0 references
    definability
    0 references
    Tarski
    0 references
    Separation principles
    0 references
    Interpolation principles
    0 references
    Finite-universe logic
    0 references
    Prefix hierarchies
    0 references
    Bipartite graphs
    0 references
    Ehrenfeucht-Fraïssé games
    0 references
    Descriptive set theory
    0 references
    Recursive function theory
    0 references
    Classical pure logic
    0 references
    Finite model theory
    0 references

    Identifiers

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