A. Nerode, J.B. Remmel. Complexity-theoretic Algebra II: Boolean Algebras. Annals of Pure and Applied Logic 44:71--99. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A theory of nonmonotonic rule systems I - Marek, Nerode, Remmel (1990) (12 citations) Self-citation (Nerode Remmel) (Correct)
.... abcissa between 0 and 1 where a given recursive continuous function on [0,1] takes a maximum value ( Huang and Nerode, 1985 ] This recursion theoretic methodology can also be refined to give complexity theoretic results on the same problems about extensions, as has been done in algebra by Nerode and Remmel in [ 1987 ] 1989 ] and [ 1990 ] Since this is a more delicate matter than the recursion theory, these developments are deferred again to a later paper. Next, we turn to investigations of the semantics of nonmonotonic rule systems. The fundamental common semantics we have found comes from L 1 , and ....
A. Nerode, J.B. Remmel. Complexity-theoretic Algebra II: Boolean Algebras. Annals of Pure and Applied Logic 44:71--99.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC