26 found
Order:
  1.  9
    Reducibility Orderings: Theories, Definability and Automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
  2.  7
    Combinatorial Functors.J. N. Crossley & Anil Nerode - 1977 - Journal of Symbolic Logic 42 (4):586-587.
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  3.  6
    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.
  4.  24
    Recursion Theory: Summer Research Institute : Papers.Anil Nerode & Richard A. Shore (eds.) - 1985 - American Mathematical Society.
    iterations of REA operators, as well as extensions, generalizations and other applications are given in [6] while those for the ...
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  5.  7
    Tableaux for Constructive Concurrent Dynamic Logic.Duminda Wijesekera & Anil Nerode - 2005 - Annals of Pure and Applied Logic 135 (1-3):1-72.
    This is the first paper on constructive concurrent dynamic logic . For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on Found. Comp. Sci., New York, 1976, pp. 109–121, V. Pratt, Applications of modal logic to programming, Studia Logica 39 257–274] (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  6.  7
    Effective Completeness Theorems for Modal Logic.Suman Ganguli & Anil Nerode - 2004 - Annals of Pure and Applied Logic 128 (1-3):141-195.
    We initiate the study of computable model theory of modal logic, by proving effective completeness theorems for a variety of first-order modal logics. We formulate a natural definition of a decidable Kripke model, and show how to construct such a decidable Kripke model of a given decidable theory. Our construction is inspired by the effective Henkin construction for classical logic. The Henkin construction, however, depends in an essential way on the Deduction Theorem. In its usual form the Deduction Theorem fails (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  7.  20
    Decidable Kripke Models of Intuitionistic Theories.Hajime Ishihara, Bakhadyr Khoussainov & Anil Nerode - 1998 - Annals of Pure and Applied Logic 93 (1-3):115-123.
    In this paper we introduce effectiveness into model theory of intuitionistic logic. The main result shows that any computable theory T of intuitionistic predicate logic has a Kripke model with decidable forcing such that for any sentence φ, φ is forced in the model if and only if φ is intuitionistically deducible from T.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  14
    Effective Content of the Calculus of Variations I: Semi-Continuity and the Chattering Lemma.Xiaolin Ge & Anil Nerode - 1996 - Annals of Pure and Applied Logic 78 (1-3):127-146.
    The content of existence theorems in the calculus of variations has been explored and an effective treatment of semi-continuity has been achieved. An algorithm has been developed which captures the natural algorithmic content of the notion of a semi-continuous function and this is used to obtain an effective version of the “chattering lemma” of control theory and ordinary differential equations. This lemma reveals the main computational content of the theory of relaxed optimal control.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9. A Universal Embedding Property of the RETs.Anil Nerode & Alfred B. Manaster - 1970 - Journal of Symbolic Logic 35 (1):51-59.
  10.  71
    Meeting of the Association for Symbolic Logic.Anil Nerode & K. J. Barwise - 1973 - Journal of Symbolic Logic 38 (2):348-358.
  11. LFCS 2013.Sergei Artemov & Anil Nerode (eds.) - 2013 - Springer.
    Translate
     
     
    Export citation  
     
    Bookmark  
  12. Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734).Sergei Artemov & Anil Nerode (eds.) - 2013 - Springer.
  13. Logic Programming and Non-Monotonic Reasoning Proceedings of the First International Workshop.Wiktor Marek, Anil Nerode, V. S. Subrahmanian & Association for Logic Programming - 1991
     
    Export citation  
     
    Bookmark  
  14.  31
    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.
  15. An Appreciation of Kreisel.Anil Nerode - 1996 - In Piergiorgio Odifreddi (ed.), Kreiseliana. About and Around Georg Kreisel. A K Peters. pp. 81.
    No categories
     
    Export citation  
     
    Bookmark  
  16.  32
    The Life and Work of Sergei Artemov.Anil Nerode & Melvin Fitting - 2014 - Annals of Pure and Applied Logic 165 (1):3-5.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  17.  18
    Preface.Sergei Artemov & Anil Nerode - 2012 - Annals of Pure and Applied Logic 163 (7):743-744.
  18.  16
    In Memoriam: Paul J. Cohen, 1934—2007.Anil Nerode - 2009 - Bulletin of Symbolic Logic 15 (4):439-440.
  19.  10
    Computing Definite Logic Programs by Partial Instantiation.Vadim Kagan, Anil Nerode & V. S. Subrahmanian - 1994 - Annals of Pure and Applied Logic 67 (1-3):161-182.
    Query processing in ground definite deductive is known to correspond precisely to a linear programming problem. However, the “groundedness” requirement is a huge drawback to using linear programming techniques for logic program computations because the ground version of a logic program can be very large when compared to the original program. Furthermore, when we move from propositional logic programs to first-order logic programs, this effectively means that functions symbols may not occur in clauses. In this paper, we develop a theory (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20.  8
    Logic at Tver '92.Anil Nerode & M. Taitslin - 1993 - Journal of Symbolic Logic 58 (3):1150-1150.
  21.  6
    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.
    In this paper, we study the lower semilattice of NP-subspaces of both the standard polynomial time representation and the tally polynomial time representation of a countably infinite dimensional vector space V∞ over a finite field F. We show that for both the standard and tally representation of V∞, there exists polynomial time subspaces U and W such that U + V is not recursive. We also study the NP analogues of simple and maximal subspaces. We show that the existence of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  22.  5
    Meeting of the Association for Symbolic Logic, New York 1969.Anil Nerode & K. J. Barwise - 1973 - Journal of Symbolic Logic 38 (2):348-358.
  23.  5
    Preface.Yuri Matiyasevich & Anil Nerode - 1996 - Annals of Pure and Applied Logic 78 (1-3):1.
  24.  11
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  5
    Preface.Anil Nerode - 2004 - Annals of Pure and Applied Logic 126 (1-3):1-2.
  26.  3
    Preface.Anil Nerode & Gerald Sacks - 1996 - Annals of Pure and Applied Logic 81 (1-3):1.