LEADER 05988nam 22007695 450 001 996466156403316 005 20200706045047.0 010 $a3-540-47890-6 024 7 $a10.1007/3-540-56992-8 035 $a(CKB)1000000000233993 035 $a(SSID)ssj0000322124 035 $a(PQKBManifestationID)11277755 035 $a(PQKBTitleCode)TC0000322124 035 $a(PQKBWorkID)10280321 035 $a(PQKB)10085117 035 $a(DE-He213)978-3-540-47890-4 035 $a(PPN)155177346 035 $a(EXLCZ)991000000000233993 100 $a20121227d1993 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers /$fedited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter 205 $a1st ed. 1993. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1993. 215 $a1 online resource (IX, 439 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v702 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-56992-8 327 $aA universal Turing machine -- Recursive inseparability in linear logic -- The basic logic of proofs -- Algorithmic structuring of cut-free proofs -- Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions -- Linear ?-calculus and categorical models revisited -- A self-interpreter of lambda calculus having a normal form -- An ?Ehrenfeucht-Fraïssé game? for fixpoint logic and stratified fixpoint logic -- The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness -- Model building by resolution -- Comparative transition system semantics -- Reasoning with higher order partial functions -- Communicating evolving algebras -- On the completeness of narrowing as the operational semantics of functional logic programming -- Inductive definability with counting on finite structures -- Linear time algorithms and NP-complete problems -- The semantics of the C programming language -- A theory of classes for a functional language with effects -- Logical definability of NP-optimisation problems with monadic auxiliary predicates -- Universes in the theories of types and names -- Notes on sconing and relators -- Solving 3-satisfiability in less than 1, 579n steps -- Kleene's slash and existence of values of open terms in type theory -- Negation-complete logic programs -- Logical characterization of bounded query classes II: Polynomial-time oracle machines -- On asymptotic probabilities of monadic second order properties. 330 $aThis volume presents the proceedings of the Computer Science Logic Workshop CSL '92, held in Pisa, Italy, in September/October 1992. CSL '92 was the sixth of the series and the first one held as Annual Conference of the European Association for Computer Science Logic (EACSL). Full versions of the workshop contributions were collected after their presentation and reviewed. On the basis of 58 reviews, 26 papers were selected for publication, and appear here in revised final form. Topics covered in the volume include: Turing machines, linear logic, logic of proofs, optimization problems, lambda calculus, fixpoint logic, NP-completeness, resolution, transition system semantics, higher order partial functions, evolving algebras, functional logic programming, inductive definability, semantics of C, classes for a functional language, NP-optimization problems, theory of types and names, sconing and relators, 3-satisfiability, Kleene's slash, negation-complete logic programs, polynomial-time oracle machines, and monadic second-order properties. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v702 606 $aComputers 606 $aSoftware engineering 606 $aMathematical logic 606 $aComputer logic 606 $aAlgorithms 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aAlgorithms. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aMathematical Logic and Foundations. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a004/.01/5113 702 $aBörger$b Egon$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJäger$b Gerhard$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKleine Büning$b Hans$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMartini$b Simone$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRichter$b Michael M$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWorkshop on Computer Science Logic 906 $aBOOK 912 $a996466156403316 996 $aComputer Science Logic$9771972 997 $aUNISA