Exhaustible sets in higher-type computation (Q3535608): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2168/lmcs-4(3:3)2008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151637386 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exhaustible sets in higher-type computation |
scientific article |
Statements
Exhaustible sets in higher-type computation (English)
0 references
13 November 2008
0 references
algorithmic universal quantification
0 references
continuous predicate
0 references
searchable sets
0 references
decidable sets
0 references
exhaustible sets
0 references
Cantor space
0 references
hierarchy of continuous functionals
0 references
