O'Donnell, MJ, see Lipton, J. 187-239 Remmel, JB, see Nerode, A. 125-170

Annals of Pure and Applied Logic 81:241 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A survey of lattices of re substructures.Anil Nerode & Jeffrey Remmel - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--323.
Complexity-theoretic algebra II: Boolean algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.
Generic objects in recursion theory II: Operations on recursive approximation spaces.A. Nerode & J. B. Remmel - 1986 - Annals of Pure and Applied Logic 31:257-288.
On the lattices of NP-subspaces of a polynomial time vector space over a finite field.Anil Nerode & J. B. Remmel - 1996 - Annals of Pure and Applied Logic 81 (1-3):125-170.
Nonmonotonic rule systems with recursive sets of restraints.V. Wiktor Marek, Anil Nerode & Jeffrey B. Remmel - 1997 - Archive for Mathematical Logic 36 (4-5):339-384.
McNaughton games and extracting strategies for concurrent programs.Anil Nerode, Jeffrey B. Remmel & Alexander Yakhnis - 1996 - Annals of Pure and Applied Logic 78 (1-3):203-242.
A context for belief revision: forward chaining-normal nonmonotomic rule systems.V. W. Marek, A. Nerode & J. B. Remmel - 1994 - Annals of Pure and Applied Logic 67 (1-3):269-323.
Logic programs, well-orderings and forward chaining.V. W. Marek, A. Nerode & J. B. Remmel - 1999 - Annals of Pure and Applied Logic 96 (1-3):231-276.
How complicated is the set of stable models of a recursive logic program?W. Marek, A. Nerode & J. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):119-135.
Kagan, V., Nerode, A. and Subrahmanian, VS., Computing definite logic.M. A. da ArchangelskyTaitslin, S. Artemov, F. A. Bluerle, J. B. Remmel, R. Harper, D. Sannella & A. Tarlecki - 1994 - Annals of Pure and Applied Logic 67:349.
Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels.James Lipton & Michael J. O'Donnell - 1996 - Annals of Pure and Applied Logic 81 (1-3):187-239.
Review: G. Metakides, A. Nerode, Recursively Enumerable Vector Spaces; G. Metakides, A. Nerode, Effective Content of Field Theory; G. Metakides, A. Nerode, Recursion Theory on Fields and Abstract Dependence. [REVIEW]A. G. Hamilton - 1983 - Journal of Symbolic Logic 48 (3):880-882.

Analytics

Added to PP
2014-03-25

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references