LEADER 03568nam 22006614a 450 001 9910455260103321 005 20200520144314.0 010 $a1-280-20550-4 010 $a9786610205509 010 $a0-306-46975-8 024 7 $a10.1007/b115304 035 $a(CKB)111056485439656 035 $a(EBL)3035676 035 $a(SSID)ssj0000245611 035 $a(PQKBManifestationID)11200528 035 $a(PQKBTitleCode)TC0000245611 035 $a(PQKBWorkID)10180571 035 $a(PQKB)10433739 035 $a(DE-He213)978-0-306-46975-6 035 $a(MiAaPQ)EBC3035676 035 $a(MiAaPQ)EBC196986 035 $a(PPN)237932695 035 $a(Au-PeEL)EBL3035676 035 $a(CaPaEBR)ebr10052991 035 $a(CaONFJC)MIL20550 035 $a(OCoLC)52085722 035 $a(Au-PeEL)EBL196986 035 $a(OCoLC)559099111 035 $a(EXLCZ)99111056485439656 100 $a20000314d2000 uy 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 12$aA short introduction to intuitionistic logic$b[electronic resource] /$fGrigori Mints 205 $a1st ed. 2000. 210 $aNew York $cKluwer Academic / Plenum Publishers$d2000 215 $a1 online resource (142 p.) 225 1 $aUniversity series in mathematics 300 $aDescription based upon print version of record. 311 $a0-306-46394-6 320 $aIncludes bibliographical references and index. 327 $aIntuitionistic Predicate Logic -- Natural Deduction System NJ -- Kripke Models for Predicate Logic -- Systems LJm, LJ -- Proof-Search in Predicate Logic -- Preliminaries -- Natural Deduction for Propositional Logic -- Negative Translation: Glivenko?s Theorem -- Program Interpretation of Intuitionistic Logic -- Computations with Deductions -- Coherence Theorem -- Kripke Models -- Gentzen-type Propositional System LJpm -- Topological Completeness -- Proof-search -- System LJp -- Interpolation Theorem. 330 $aIntuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device for making this book short was inventing new proofs of several theorems. The presentation is based on natural deduction. The topics include programming interpretation of intuitionistic logic by simply typed lambda-calculus (Curry-Howard isomorphism), negative translation of classical into intuitionistic logic, normalization of natural deductions, applications to category theory, Kripke models, algebraic and topological semantics, proof-search methods, interpolation theorem. The text developed from materal for several courses taught at Stanford University in 1992-1999. 410 0$aUniversity series in mathematics (Plenum Press) 606 $aIntuitionistic mathematics 608 $aElectronic books. 615 0$aIntuitionistic mathematics. 676 $a511/.22 700 $aMint?s$b G. E$062942 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910455260103321 996 $aA short introduction to intuitionistic logic$91892807 997 $aUNINA