Boolean logic in artificial intelligence and Turing degrees of Boolean-valued sets
Over the years a number of generalizations of recursion theory have been introduced and studied. In this dissertation the author presents yet another such generalization. Based on the concept of a weakly recursively presented Boolean algebra, he defines Boolean-valued sets, Boolean-valued recursive sets, and Boolean-valued recursively enumerable sets and discuss the basic relationships between a Boolean-valued set, its principal part, and its support. Then he generalizes many elementary concepts and results about recursive and recursively enumerable sets such as the s-m-n theorem, the recursion theorem, and the projection theorem, etc. to Boolean valued sets. By using finite and infinite injury arguments, he generalizes the Friedberg-Muchnik theorem, the theorem about nonrecursive low r.e. sets, the minimal pair theorem, and other results. Finally, he discusses the possible application of Boolean-valued logic in artificial intelligence, and gives an implementation of a parser for the four-valued Boolean logic.
- Research Organization:
- California Univ., Berkeley, CA (USA)
- OSTI ID:
- 6309943
- Resource Relation:
- Other Information: Thesis (Ph.D)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Higher-degree linear approximations of nonlinear systems
Design of fault tolerant programmable logic arrays for yield enhancement