7 found
Sort by:
Disambiguations:
Natarajan Shankar [5]N. Shankar [2]
  1. Scot Adams, Shaughan Lavine, Zlil Sela, Natarajan Shankar, Stephen Simpson, Stevo Todorcevic & Theodore A. Slaman (2003). University of Nevada, Las Vegas, Las Vegas, Nevada June 1–4, 2002. Bulletin of Symbolic Logic 9 (1).
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. N. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. 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 (...)
     
    My bibliography  
     
    Export citation  
  3. Natarajan Shankar (1994). Review: Larry Wos, Ross Overbeek, Ewing Lusk, Jim Boyle, Automated Reasoning. Introduction and Applications. [REVIEW] Journal of Symbolic Logic 59 (4):1437-1439.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Natarajan Shankar (1994). Wos Larry, Overbeek Ross, Lusk Ewing, and Boyle Jim. Automated Reasoning. Introduction and Applications. Of LI 464. McGraw-Hill, New York Etc. 1992, Xvi+ 656 Pp.+ Disk. [REVIEW] Journal of Symbolic Logic 59 (4):1437-1439.
    Direct download  
     
    My bibliography  
     
    Export citation  
  5. P. Lincoln, A. Scedrov & N. Shankar (1993). 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] Annals of Pure and Applied Logic 60:291.
     
    My bibliography  
     
    Export citation  
  6. Patrick Lincoln, Andre Scedrov & Natarajan Shankar (1993). Linearizing Intuitionistic Implication. 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 (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar (1992). Decision Problems for Propositional Linear Logic. 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 (3 more)  
     
    My bibliography  
     
    Export citation