Natarajan Shankar [5]N. Shankar [2]
See also
Natarajan Shankar
International University College
  1.  23
    Decision problems for propositional linear logic.Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar - 1992 - Annals of Pure and Applied Logic 56 (1-3):239-311.
    Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. This accounting is made possible by removing the ‘structural’ rules of contraction and weakening, adding a modal operator and adding finer versions of the propositional connectives. Linear logic has fundamental logical interest and applications to computer science, particularly to Petri nets, concurrency, storage allocation, garbage collection and the control structure of logic programs. In addition, there is a direct correspondence between polynomial-time computation (...)
    Direct download (5 more)  
    Export citation  
    Bookmark   42 citations  
  2.  12
    Linearizing intuitionistic implication.Patrick Lincoln, Andre Scedrov & Natarajan Shankar - 1993 - Annals of Pure and Applied Logic 60 (2):151-177.
    An embedding of the implicational propositional intuitionistic logic into the nonmodal fragment of intuitionistic linear logic is given. The embedding preserves cut-free proofs in a proof system that is a variant of IIL. The embedding is efficient and provides an alternative proof of the PSPACE-hardness of IMALL. It exploits several proof-theoretic properties of intuitionistic implication that analyze the use of resources in IIL proofs.
    Direct download (4 more)  
    Export citation  
    Bookmark   8 citations  
  3.  17
    Metamathematics, machines, and Gödel's proof.N. Shankar - 1994 - New York: Cambridge University Press.
    The automatic verification of large parts of mathematics has been an aim of many mathematicians from Leibniz to Hilbert. While Gödel's first incompleteness theorem showed that no computer program could automatically prove certain true theorems in mathematics, the advent of electronic computers and sophisticated software means in practice there are many quite effective systems for automated reasoning that can be used for checking mathematical proofs. This book describes the use of a computer program to check the proofs of several celebrated (...)
    Direct download  
    Export citation  
    Bookmark   3 citations  
  4. BERGER, U., Total sets and objects in domain theory DOWNEY, R., Every recursive boolean algebra is isomorphic to one with incomplete atoms GONCHAREV, S., YAKHNIS, A. and YAKHNIS, V., Some effectively infinite classes of enumerations. [REVIEW]P. Lincoln, A. Scedrov & N. Shankar - 1993 - Annals of Pure and Applied Logic 60:291.
  5.  21
    Larry Wos, Ross Overbeek, Ewing Lusk, and Jim Boyle. Automated reasoning. Introduction and applications. Second edition of LI 464. McGraw-Hill, New York etc. 1992, xvi + 656 pp. + disk. [REVIEW]Natarajan Shankar - 1994 - Journal of Symbolic Logic 59 (4):1437-1439.
    Direct download (4 more)  
    Export citation  
  6. University of Nevada, Las Vegas, Las Vegas, Nevada June 1–4, 2002.Scot Adams, Shaughan Lavine, Zlil Sela, Natarajan Shankar, Stephen Simpson, Stevo Todorcevic & Theodore A. Slaman - 2003 - Bulletin of Symbolic Logic 9 (1).
    Export citation  
  7.  1
    Ontic: A knowledge representation system for mathematics.Natarajan Shankar - 1993 - Artificial Intelligence 62 (2):355-362.
    Direct download (2 more)  
    Export citation