Opening book details…
Can I read The Completeness Modulo Ideal in Functional Systems of a Program Type on EtoBox?
The Completeness Modulo Ideal in Functional Systems of a Program Type by YU. V. GOLUNKOV is a Computer Science article available to read on EtoBox.
What is The Completeness Modulo Ideal in Functional Systems of a Program Type about?
In a functional system of a program type the fundamental set R consists of functions and predicates, and the operations are defined by a class of program schemes or a set of programming operations. Systems of one-place partially recursive functions and predicates are investigated. A set M C R is called J-complete where J denotes an ideal in the lattice of recursively enumerable sets, if for every element t G R and for every set X G J there exists an element t' in the closure of the set M such that t' is equal to t on X. It is established that the J-completeness problem is not simpler than the problem of ordinary completeness if the ideal J contains an infinite set, and therefore the perfectly investigated completeness modulo ideal of finite sets is unique.
Who reads The Completeness Modulo Ideal in Functional Systems of a Program Type?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- YU. V. GOLUNKOV
- Publisher
- Walter de Gruyter GmbH
- Published
- 1992
- Language
- EN
- Field
- Computer Science (Physical Sciences)