No label defined (Q4249723)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1303200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1303200 |
Statements
15 September 1999
0 references
\(\Pi^0_1\) classes
0 references
recursive algebra
0 references
recursive combinatorics
0 references
recursive graphs
0 references
survey
0 references
nonmonotonic logic
0 references
0.9170645
0 references
0 references
0.8876345
0 references
0 references
0.86933273
0 references
A survey (including some new results) of the occurrences and uses of \(\Pi^0_1\) classes in areas such as logic, nonmonotonic logic, algebra, analysis, and combinatorics. More specifically, a typical result here represents \(\Pi^0_1\) classes by solutions to problems in one of these areas of application. E.g., given a recursive graph, its set of \(k\)-colorings forms a recursively bounded \(\Pi^0_1\) class. The representation result, loosely stated, is that every recursively bounded \(\Pi^0_1\) class arises in this manner. Such a representation then allows the general machinery of \(\Pi^0_1\) classes to be brought to bear on, in this case, recursive graph theory. Polynomial-time versions of these ideas are also treated. For the entire collection see [Zbl 0905.03002].
0 references
