KIAM Main page Web Library  •  Publication Searh  Русский 

Article collection "Mathematical Problems of Cybernetics" №6, Moscow, 1996
Authors: Marchenkov S.S.
Precompleteness of closed classes in Pk: predicate approach
Precompleteness of k-valued logic closed classes is proved using predicate language by means of the minimal predicate and (∃, &)-formula notions.
bases under superposition, classes of recursive functions
Publication language: russian,  pages: 16 (p. 117-132)
Research direction:
Mathematical problems and theory of numerical methods
Russian source text:
Export link to publication in format:   RIS    BibTex