LEADER 04559nam 22006615 450 001 996466136703316 005 20200702093855.0 010 $a3-540-44720-2 024 7 $a10.1007/3-540-60178-3 035 $a(CKB)1000000000234316 035 $a(SSID)ssj0000324488 035 $a(PQKBManifestationID)11254566 035 $a(PQKBTitleCode)TC0000324488 035 $a(PQKBWorkID)10312935 035 $a(PQKB)10769517 035 $a(DE-He213)978-3-540-44720-7 035 $a(PPN)15516337X 035 $a(EXLCZ)991000000000234316 100 $a20121227d1995 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic and Computational Complexity$b[electronic resource] $eInternational Workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers /$fedited by Daniel Leivant 205 $a1st ed. 1995. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995. 215 $a1 online resource (VIII, 520 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v960 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-60178-3 327 $aStrict finitism and feasibility -- Logical omniscience -- On feasible numbers -- On parallel hierarchies and R k i -- Program extraction from classical proofs -- Computation models and function algebras -- Expressing computational complexity in constructive type theory -- Light linear logic -- Intrinsic theories and computational complexity -- On Herbrand's theorem -- Some consequences of cryptographical conjectures for S 2 1 and EF -- Frege proof system and TNC° -- Characterizing parallel time by type 2 recursions with polynomial output length -- Type 2 polynomial hierarchies -- The hierarchy of terminating recursive programs over N -- Feasibly categorical models -- Metafinite model theory -- Automatic presentations of structures -- A restricted second order logic for finite structures -- Comparing the power of monadic NP games -- Linear constraint query languages expressive power and complexity -- A constant-space sequential model of computation for first-order logic -- Logics capturing relativized complexity classes uniformly -- Preservation theorems in finite model theory -- A query language for NC (extended abstract). 330 $aThis book contains revised versions of papers invited for presentation at the International Workshop on Logic and Computational Complexity, LCC '94, held in Indianapolis, IN in October 1994. The synergy between logic and computational complexity has gained importance and vigor in recent years, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; they are presented in sections on foundational issues, applicative and proof-theoretic complexity, complexity of proofs, computational complexity of functionals, complexity and model theory, and finite model theory. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v960 606 $aComputer science?Mathematics 606 $aComputers 606 $aAlgorithms 606 $aMathematical logic 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 615 0$aComputer science?Mathematics. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aMathematical logic. 615 14$aMathematics of Computing. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aMathematical Logic and Formal Languages. 615 24$aMathematical Logic and Foundations. 676 $a511.3 702 $aLeivant$b Daniel$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466136703316 996 $aLogic and Computational Complexity$92830531 997 $aUNISA