LEADER 06429nam 22007335 450 001 996465700503316 005 20200701214427.0 010 $a3-540-45220-6 024 7 $a10.1007/b13224 035 $a(CKB)1000000000212167 035 $a(SSID)ssj0000322122 035 $a(PQKBManifestationID)11243178 035 $a(PQKBTitleCode)TC0000322122 035 $a(PQKBWorkID)10281234 035 $a(PQKB)11062426 035 $a(DE-He213)978-3-540-45220-1 035 $a(MiAaPQ)EBC3088376 035 $a(PPN)15518895X 035 $a(EXLCZ)991000000000212167 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings /$fedited by Matthias Baaz, Johann M. Makowsky 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XII, 596 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2803 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-40801-0 320 $aIncudes bibliographical references at the end of each chapters and index. 327 $aDeciding Monotonic Games -- The Commuting V-Diagram -- Concurrent Construction of Proof-Nets -- Back to the Future: Explicit Logic for Computer Science -- Constraint Satisfaction with Countable Homogeneous Templates -- Quantified Constraints: Algorithms and Complexity -- Verification of Infinite State Systems -- Parity of Imperfection or Fixing Independence -- Atomic Cut Elimination for Classical Logic -- Computational Mathematics, Computational Logic, and Symbolic Computation -- Simple Stochastic Parity Games -- Machine Characterizations of the Classes of the W-Hierarchy -- Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions -- On Relativisation and Complexity Gap for Resolution-Based Proof Systems -- Strong Normalization of the Typed ? ws -Calculus -- A Fixed-Point Logic with Symmetric Choice -- Positive Games and Persistent Strategies -- Generating All Abductive Explanations for Queries on Propositional Horn Theories -- Refined Complexity Analysis of Cut Elimination -- Comparing the Succinctness of Monadic Query Languages over Finite Trees -- The Arithmetical Complexity of Dimension and Randomness -- Towards a Proof System for Admissibility -- Program Complexity of Dynamic LTL Model Checking -- Coping Polynomially with Numerous but Identical Elements within Planning Problems -- On Algebraic Specifications of Abstract Data Types -- On the Complexity of Existential Pebble Games -- Computational Aspects of ?-Definability over the Real Numbers without the Equality Test -- The Surprising Power of Restricted Programs and Gödel?s Functionals -- Pebble Games on Trees -- Bistability: An Extensional Characterization of Sequentiality -- Automata on Lempel-Ziv Compressed Strings -- Complexity of Some Problems in Modal and Intuitionistic Calculi -- Goal-Directed Calculi for Gödel-Dummett Logics -- A Logic for Probability in Quantum Systems -- A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory -- The Epsilon Calculus -- Modular Semantics and Logics of Classes -- Validity of CTL Queries Revisited -- Calculi of Meta-variables -- Henkin Models of the Partial ?-Calculus -- Nominal Unification -- Friends or Foes? Communities in Software Verification -- More Computation Power for a Denotational Semantics for First Order Logic -- Effective Model Completeness of the Theory of Restricted Pfaffian Functions -- Effective Quantifier Elimination over Real Closed Fields -- Fast Infinite-State Model Checking in Integer-Based Systems -- Winning Strategies and Synthesis of Controllers -- Logical Relations for Dynamic Name Creation. 330 $a This book constitutes the joint refereed proceedings of the 17th International Workshop on Computer Science Logic, CSL 2003, held as the 12th Annual Conference of the EACSL and of the 8th Kurt Gödel Colloquium, KGC 2003 in Vienna, Austria, in August 2003. The 30 revised full papers presented together with abstracts of 9 invited presentations were carefully reviewed and selected from a total of 112 submissions. All current aspects of computer science logic are addressed ranging from mathematical logic and logical foundations to the application of logics in various computing aspects. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2803 606 $aMathematical logic 606 $aComputer logic 606 $aArtificial intelligence 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aScience, Humanities and Social Sciences, multidisciplinary$3https://scigraph.springernature.com/ontologies/product-market-codes/A11007 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aArtificial intelligence. 615 14$aMathematical Logic and Formal Languages. 615 24$aScience, Humanities and Social Sciences, multidisciplinary. 615 24$aLogics and Meanings of Programs. 615 24$aArtificial Intelligence. 615 24$aMathematical Logic and Foundations. 676 $a005.1/01/5113 702 $aBaaz$b Matthias$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMakowsky$b Johann M$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aEuropean Association for Computer Science Logic.$bConference$d(12th :$f2003 :$eVienna University of Technology) 712 12$aKurt Go?del Colloquium$d(8th :$f2003 :$eVienna University of Technology) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465700503316 996 $aComputer Science Logic$9771972 997 $aUNISA LEADER 01460nam 2200445 450 001 9910159010703321 005 20230810001737.0 010 $a1-78010-844-3 035 $a(CKB)3710000001018500 035 $a(MiAaPQ)EBC5493512 035 $a(MiAaPQ)EBC6166251 035 $a(Au-PeEL)EBL6166251 035 $a(EXLCZ)993710000001018500 100 $a20220812d2017 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aWhirlwind /$fHilary Norman 210 1$aLondon, England :$cSevern House Publishers,$d[2017] 210 4$dİ2017 215 $a1 online resource (260 pages) 311 $a0-7278-8673-8 330 $aLiza Plain, a Boston-based journalist hoping for her big break, is dreading spending Christmas in Rhode Island, with her difficult grandfather - until news of the disappearance of a retired local priest triggers her realization that this could be linked to a series of unsolved, church-linked missing persons cases. 606 $aMissing persons 606 $aBlizzards 606 $aSevere storms 615 0$aMissing persons. 615 0$aBlizzards. 615 0$aSevere storms. 676 $a823.914 700 $aNorman$b Hilary$01249732 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910159010703321 996 $aWhirlwind$92895969 997 $aUNINA LEADER 01373nam0 22003371i 450 001 UON00230789 005 20231205103500.430 100 $a20030730d1981 |0itac50 ba 101 $ager 102 $aDE 105 $a|||| ||||| 200 1 $aˆDie ‰ Grossen Philosophen$fKarl Jaspers$ghrsg. von Hans Saner, unter mitarbeit von Raphael Bielander 205 $aMunchen$gZurich : Piper & Co. 210 $a2 v.$a23 cm 215 $av. 1.: Darstellungen und Fragmente 316 $aAltro inv.: 4404$5IT-UONSI CONS. FPIII0176/(1-2) 423 1$1001UON00371962$12001 $a Darstellungen und Fragmente 423 1$1001UON00371963$12001 $a Fragmente Anmerkungen Inventar 620 $aDE$dMünchen$3UONL003025 620 $aCH$dZürich$3UONL003145 676 $a193$cFilosofia occidentale moderna. Germania e Austria$v21 700 1$aJASPERS$bKarl$3UONV138528$0123629 702 1$aBIELANDER$bRaphael$3UONV139901 702 1$aSANER$bHans$3UONV139900 712 $aPiper & Co$3UONV258994$4650 801 $aIT$bSOL$c20240220$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00230789 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI CONS. FP III 0176 (1-2) $eSI FP 4465 5 (1-2) Altro inv.: 4404 996 $aGrossen Philosophen$9947917 997 $aUNIOR