On algorithmic solvability of the \(A\)-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate \(S\)-functions (Q5299971)
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 6180059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On algorithmic solvability of the \(A\)-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate \(S\)-functions |
scientific article; zbMATH DE number 6180059 |
Statements
On algorithmic solvability of the A-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate S-functions (English)
0 references
24 June 2013
0 references
\(A\)-completeness
0 references
\(A\)-precompleteness
0 references
boundedly determinate
0 references
0.9030131697654724
0 references
0.8490803241729736
0 references
0.8098156452178955
0 references
