Anil Nerode
Affiliations: | Cornell University, Ithaca, NY, United States |
Area:
MathematicsGoogle:
"Anil Nerode"Children
Sign in to add trainee| Suman Ganguli | grad student | 2001 | Cornell |
| Aaron A. Diaz | grad student | 2003 | Cornell |
| Rebecca A. Schuller | grad student | 2003 | Cornell |
| Serguei A. Slavnov | grad student | 2005 | Cornell |
| Bryant Adams | grad student | 2008 | Cornell |
| Edoardo Carta | grad student | 2008 | Cornell |
| Mor M. Minnes | grad student | 2008 | Cornell |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Artemov S, Nerode A. (2020) Special Issue on Logical Foundations of Computer Science Journal of Logic and Computation. 30: 1-1 |
| Nerode A, Remmel JB. (2008) Consistency properties and set based logic programming Annals of Mathematics and Artificial Intelligence. 53: 289-311 |
| Wijesekera D, Nerode A. (2005) Tableaux for constructive concurrent dynamic logic Annals of Pure and Applied Logic. 135: 1-72 |
| Ganguli S, Nerode A. (2004) Effective completeness theorems for modal logic Annals of Pure and Applied Logic. 128: 141-195 |
| Davoren JM, Moor T, Goré RP, et al. (2004) On two-sided approximate model-checking: problem formulation and solution via finite topologies Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3253: 52-67 |
| Wijesekera D, Ganesh M, Srivastava J, et al. (2001) Normal forms and syntactic completeness proofs for functional independencies Theoretical Computer Science. 266: 365-405 |
| Marek VW, Nerode A, Remmel JB. (1999) Logic programs, well-orderings, and forward chaining Annals of Pure and Applied Logic. 96: 231-276 |
| Ishihara H, Khoussainov B, Nerode A. (1998) Decidable Kripke models of intuitionistic theories Annals of Pure and Applied Logic. 93: 115-123 |
| Ishihara H, Khoussainov B, Nerode A. (1998) Computable Kripke Models and Intermediate Logics Information and Computation. 143: 205-230 |
| Marek VW, Nerode A, Remmel JB. (1997) Complexity of recursive normal default logic Fundamenta Informaticae. 32: 139-147 |