Effective choice for relations and reducibilities in classes of constructive and positive models (Q1317601)
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 536654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Effective choice for relations and reducibilities in classes of constructive and positive models |
scientific article; zbMATH DE number 536654 |
Statements
Effective choice for relations and reducibilities in classes of constructive and positive models (English)
0 references
12 April 1994
0 references
Effective choice problems admit distinct variations in the classes of constructive and positive models, and, in most cases, have obvious formalizations. For an intrinsically recursively enumerable relation, for a constructivizable (i.e. recursive) autostable model, and for a positive autostable model, the author specifies the property of effective choice problems to be decidable.
0 references
constructivizable model
0 references
positive models
0 references
intrinsically recursively enumerable relation
0 references
autostable model
0 references
effective choice problems
0 references
0 references
0.8582330942153931
0 references
0.8577658534049988
0 references
0.827335774898529
0 references
0.8258943557739258
0 references
