On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions
From MaRDI portal
Publication:3225871
Recommendations
- The completeness criterion for \(S\)-sets of determinate functions
- A problem of completeness of S-sets of deterministic functions
- On algorithmic solvability of the \(A\)-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate \(S\)-functions
- On the existence of an algorithm for recognizing the \(\mathcal A\)-completeness of systems containing all one-place bounded-determinate functions.
- scientific article; zbMATH DE number 468641
Cited in
(8)- The completeness criterion for \(S\)-sets of determinate functions
- scientific article; zbMATH DE number 1775536 (Why is no real title available?)
- A problem of completeness of S-sets of deterministic functions
- scientific article; zbMATH DE number 4105274 (Why is no real title available?)
- 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 497612 (Why is no real title available?)
- On the \(\tau\)-completeness of systems containing all one-place determinate functions.
- On the existence of an algorithm for recognizing the \(\mathcal A\)-completeness of systems containing all one-place bounded-determinate functions.
This page was built for publication: On completeness and \(A\)-completeness of \(S\)-sets of determinate functions containing all one-place determinate \(S\)-functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225871)