LEADER 05418nam 22007575 450 001 996465564903316 005 20200701222648.0 010 $a3-540-44622-2 024 7 $a10.1007/3-540-44622-2 035 $a(CKB)1000000000211277 035 $a(SSID)ssj0000322119 035 $a(PQKBManifestationID)11937852 035 $a(PQKBTitleCode)TC0000322119 035 $a(PQKBWorkID)10281436 035 $a(PQKB)11544723 035 $a(DE-He213)978-3-540-44622-4 035 $a(MiAaPQ)EBC3071790 035 $a(PPN)155234102 035 $a(EXLCZ)991000000000211277 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e14th International Workshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21-26, 2000 Proceedings /$fedited by Peter G. Clote, Helmut Schwichtenberg 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XIV, 550 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1862 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67895-6 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Background, Reserve, and Gandy Machines -- Choiceless Polynomial Time Computation and the Zero-One Law -- Composition and Submachine Concepts for Sequential ASMs -- Une tentative malheureuse de construire une structure éliminant rapidement les quanteurs -- Translating Theory into Practice ? Abstract State Machines within Microsoft -- Choiceless Polynomial Time Logic: Inability to Express -- Schema Revisited -- Automated Verification = Graphs, Automata, and Logic -- Contributed Papers -- A Fully Complete PER Model for ML Polymorphic Types -- Subtyping with Power Types -- The Descriptive Complexity of the Fixed-Points of Bounded Formulas -- Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic -- Continuous Functionals of Dependent Types and Equilogical Spaces -- Definability over Linear Constraints -- Bounded Arithmetic and Descriptive Complexity -- Independence: Logics and Concurrency -- Flatness Is Not a Weakness -- Sequents, Frames, and Completeness -- Disjunctive Tautologies as Synchronisation Schemes -- Axiomatizing the Least Fixed Point Operation and Binary Supremum -- Interactive Programs in Dependent Type Theory -- Modal Satisfiability Is in Deterministic Linear Space -- Logic Programming and Co-inductive Definitions -- A Theory of Explicit Mathematics Equivalent to ID 1 -- On the Complexity of Explicit Modal Logics -- Finite Models and Full Completeness -- On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale -- Elimination of Negation in a Logical Framework -- Discreet Games, Light Affine Logic and PTIME Computation -- Completeness of Higher-Order Duration Calculus -- Equational Termination by Semantic Labelling -- On the Computational Interpretation of Negation -- From Programs to Games: Invariance and Safety for Bisimulation -- Logical Relations and Data Abstraction -- Elementary Choiceless Constructive Analysis -- On the Logic of the Standard Proof Predicate. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1862 606 $aArtificial intelligence 606 $aProgramming languages (Electronic computers) 606 $aArchitecture, Computer 606 $aMathematical logic 606 $aComputer logic 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 615 0$aArtificial intelligence. 615 0$aProgramming languages (Electronic computers). 615 0$aArchitecture, Computer. 615 0$aMathematical logic. 615 0$aComputer logic. 615 14$aArtificial Intelligence. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aComputer System Implementation. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Foundations. 676 $a004/.01/5113 702 $aClote$b Peter G$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSchwichtenberg$b Helmut$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aEuropean Association for Computer Science Logic.$bConference$d(9th :$f2000 :$eFischbachau, Germany), 712 12$aWorkshop on Computer Science Logic 906 $aBOOK 912 $a996465564903316 996 $aComputer Science Logic$9771972 997 $aUNISA LEADER 01051nam a2200325 i 4500 001 991001008379707536 005 20020507181539.0 008 940712s1984 ne ||| | eng 020 $a9061962714 035 $ab10788323-39ule_inst 035 $aLE01305671$9ExL 040 $aDip.to Matematica$beng 082 0 $a512.55 084 $aAMS 17B 084 $aAMS 17B05 084 $aAMS 33A75 (1985) 084 $aAMS 43A90 100 1 $aHoogenboom, B.$0535755 245 10$aIntertwining functions on compact Lie groups /$cB. Hoogenboom 260 $aAmsterdam :$bMath. Centrum,$c1984 300 $a81 p. ;$c24 cm. 490 0 $aCWI Tract ;$v5 650 4$aLie algebras 650 4$aLie groups 907 $a.b10788323$b23-02-17$c28-06-02 912 $a991001008379707536 945 $aLE013 17B HOO11 (1984)$g1$i2013000000695$lle013$o-$pE0.00$q-$rl$s- $t0$u1$v0$w1$x0$y.i10888627$z28-06-02 996 $aIntertwining functions on compact Lie groups$9921259 997 $aUNISALENTO 998 $ale013$b01-01-94$cm$da $e-$feng$gne $h0$i1