Order:
Disambiguations
Anil Nerode [38]A. Nerode [37]
  1.  24
    Recursion Theory and Algebra.G. Metakides, A. Nerode, J. N. Crossley, Iraj Kalantari & Allen Retzlaff - 1986 - Journal of Symbolic Logic 51 (1):229-232.
    Direct download  
     
    Export citation  
     
    Bookmark   22 citations  
  2.  12
    Reducibility orderings: Theories, definability and automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
  3.  8
    Combinatorial Functors.J. N. Crossley & Anil Nerode - 1977 - Journal of Symbolic Logic 42 (4):586-587.
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  4.  11
    A survey of lattices of re substructures.Anil Nerode & Jeffrey Remmel - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--323.
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  5.  31
    Recursion theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - Providence, R.I.: 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  
  6.  17
    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   5 citations  
  7.  19
    Complexity-theoretic algebra II: Boolean algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.
  8.  11
    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  
  9. Downey, R., Fiiredi, Z., Jockusch Jr., CG and Ruhel, LA.W. I. Gasarch, A. C. Y. Lee, M. Groszek, T. Hummel, V. S. Harizanov, H. Ishihara, B. Khoussainov, A. Nerode, I. Kalantari & L. Welch - 1998 - Annals of Pure and Applied Logic 93:263.
     
    Export citation  
     
    Bookmark   3 citations  
  10.  32
    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 (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11. A universal embedding property of the RETs.Anil Nerode & Alfred B. Manaster - 1970 - Journal of Symbolic Logic 35 (1):51-59.
  12.  30
    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  
  13.  20
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14. LFCS 2013.Sergei Artemov & Anil Nerode (eds.) - 2013 - Springer.
     
    Export citation  
     
    Bookmark  
  15. Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734).Sergei Artemov & Anil Nerode (eds.) - 2013 - Springer.
     
    Export citation  
     
    Bookmark  
  16.  21
    Preface.Sergei Artemov & Anil Nerode - 2012 - Annals of Pure and Applied Logic 163 (7):743-744.
  17.  30
    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  
  18.  36
    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.
    A number of nonmonotonic reasoning formalisms have been introduced to model the set of beliefs of an agent. These include the extensions of a default logic, the stable models of a general logic program, and the extensions of a truth maintenance system among others. In [13] and [16], the authors introduced nonmonotomic rule systems as a nonlogical generalization of all essential features of such formulisms so that theorems applying to all could be proven once and for all. In this paper, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  18
    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.
    Gelfond and Lifschitz proposed the notion of a stable model of a logic program. We establish that the set of all stable models in a Herbrand universe of a recursive logic program is, up to recursive renaming, the set of all infinite paths of a recursive, countably branching tree, and conversely. As a consequence, the problem, given a recursive logic program, of determining whether it has at least one stable model, is Σ11-complete. Due to the equivalences established in the authors' (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  4
    Logic Programming and Non-monotonic Reasoning: Proceedings of the First International Workshop.Wiktor Marek, Anil Nerode, V. S. Subrahmanian & Association for Logic Programming - 1991 - MIT Press (MA).
    The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found in human reasoning. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  21.  7
    Preface.Yuri Matiyasevich & Anil Nerode - 1996 - Annals of Pure and Applied Logic 78 (1-3):1.
  22. 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  
  23.  12
    J. C. E. Dekker and J. Myhill. Retraceable sets. Canadian journal of mathematics, vol. 10 , pp. 357–373.A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):84-85.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  20
    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.
  25.  3
    Goodstein R. L.. The recursive irrationality of π.A. Nerode - 1960 - Journal of Symbolic Logic 25 (2):166-167.
  26.  19
    In memoriam: Paul J. Cohen, 1934—2007.Anil Nerode - 2009 - Bulletin of Symbolic Logic 15 (4):439-440.
  27.  7
    John Crossley: A life intellectual.Anil Nerode - 2023 - Logic Journal of the IGPL 31 (6):1023-1023.
    John Newcombe Crossley is a man of many talents, fortunate to have lived an eventful life. He is a mathematician, a logician, a historian of ancient mathematics.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28.  3
    Kleene S. C.. Quantification of number-theoretic functions. Compositio mathematica, vol. 14 no. 1 , pp. 23–40.A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-82.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29.  8
    Logic at Tver '92.Anil Nerode & M. Taitslin - 1993 - Journal of Symbolic Logic 58 (3):1150-1150.
  30.  13
    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  
  31.  10
    Myhill John. Recursive digraphs, splinters, and cylinders. Mathematische Annalen, vol. 138 , pp. 211–218.A. Nerode - 1960 - Journal of Symbolic Logic 25 (4):361-362.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32.  80
    Meeting of the association for symbolic logic.Anil Nerode & K. J. Barwise - 1973 - Journal of Symbolic Logic 38 (2):348-358.
  33.  9
    Meeting of the Association for Symbolic Logic, New York 1969.Anil Nerode & K. J. Barwise - 1973 - Journal of Symbolic Logic 38 (2):348-358.
  34.  13
    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  
  35.  23
    Preface.A. Nerode & M. A. Taitslin - 1994 - Annals of Pure and Applied Logic 67 (1-3):1.
  36.  5
    Preface.Anil Nerode & Gerald Sacks - 1996 - Annals of Pure and Applied Logic 81 (1-3):1.
  37.  5
    Preface.Anil Nerode - 2004 - Annals of Pure and Applied Logic 126 (1-3):1-2.
  38.  4
    P. Lorenzen and J. Myhill. Constructive definition of certain analytic sets of numbers. The journal of symbolic logic, vol. 24 no. 1 , pp. 37–49.A. Nerode - 1968 - Journal of Symbolic Logic 33 (2):295.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  9
    Shoenfield J. R.. Quasicreative sets. Proceedings of the American Mathematical Society, vol. 8 , pp. 964–967.A. Nerode - 1960 - Journal of Symbolic Logic 25 (2):166-166.
  40.  42
    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  
  41.  37
    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.
  42.  3
    Review: S. C. Kleene, Quantification of Number-Theoretic Functions. [REVIEW]A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-82.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  43.  20
    Reviews. Evert W. Beth. The foundations of mathematics, A study in the philosophy of science. Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1959, XXVI + 741 pp. [REVIEW]A. Nerode & Raymond M. Smullyan - 1962 - Journal of Symbolic Logic 27 (1):73-75.
  44.  7
    Kleene S. C.. Recursive functionals and quantifiers of finite types I. Transactions of the American Mathematical Society, vol. 91 , pp. 1–52. [REVIEW]A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-83.
  45.  10
    Lacombe Daniel. Classes récursivement fermées et fonctions majorantes. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 240 , pp. 716–718. [REVIEW]A. Nerode - 1959 - Journal of Symbolic Logic 24 (1):52-53.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  46.  27
    Daniel Lacombe. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 240 , pp. 2478–2480, and vol. 241 , pp. 13–14, 151–153. - Daniel Lacombe. Remarques sur les opérateurs récursifs et surles fonctions récursives d'une variable réelle. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 241 , pp. 1250–1252. [REVIEW]A. Nerode - 1959 - Journal of Symbolic Logic 24 (1):53-53.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  47.  16
    Lacombe Daniel. Les ensembles récursivement ouverts ou fermés, et leurs applications à l'analyse récursive. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 245 , pp. 1040–1043. [REVIEW]A. Nerode - 1959 - Journal of Symbolic Logic 24 (1):53-53.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  48. Review: Daniel Lacombe, Les Ensembles Recursivement Ouverts ou Fermes, et Leurs Applications a L'Analyse Recursive. [REVIEW]A. Nerode - 1959 - Journal of Symbolic Logic 24 (1):53-53.
  49. Review: Daniel Lacombe, Quelques Proprietes d'Analyse Recursive. [REVIEW]A. Nerode - 1959 - Journal of Symbolic Logic 24 (1):53-54.
  50.  4
    Review: Daniel Lacombe, Classes Recursivement Fermees et Fonctions Majorantes. [REVIEW]A. Nerode - 1959 - Journal of Symbolic Logic 24 (1):52-53.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 57