On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions

DOI10.1515/DMA.2009.015zbMATH Open1235.03057MaRDI QIDQ3225871FDOQ3225871

Authors: M. A. Podkolzina 

Publication date: 23 March 2012

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

functional completenessrecognition algorithmprecomplete classfunctional systemrecognizing automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Many-valued logic (03B50)

Cited In (8)

• Title not available (Why is that?)
• A problem of completeness of S-sets of deterministic functions
• Title not available (Why is that?)
• The completeness criterion for \(S\)-sets of determinate functions
• 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.
• Title not available (Why is that?)
• On algorithmic solvability of the \(A\)-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate \(S\)-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)