Precompleteness of closed classes in P<sub>k</sub>: predicate approach

	Web Library • Publication Searh	Русский
	Publication

Article collection "Mathematical Problems of Cybernetics" №6, Moscow, 1996

Authors: Marchenkov S.S.

Precompleteness of closed classes in P_k: predicate approach

Abstract:

Precompleteness of k-valued logic closed classes is proved using predicate language by means of the minimal predicate and (∃, &)-formula notions.

Keywords:

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:

List of publications citation:

Export link to publication in format:

About authors:

Marchenkov Sergey Seraphimovich, , Факультет вычислительной математики и кибернетики МГУ, кафедра математической кибернетики