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
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic |
scientific article; zbMATH DE number 2083173
| 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; zbMATH DE number 2083173 |
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
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
0 references
0 references
