LEADER 01110nam0 22002773i 450 001 SUN0063092 005 20160622011357.372 010 $a978-00-7148-839-6 100 $a20080227d2007 |0engc50 ba 101 $aeng 102 $aUS 105 $a|||| ||||| 200 1 $aBasics of CMOS cell design$fEtienne Sicard, Sonia Delmas Bendhia 210 $aNew York$cMcGraw-Hill$d2007 215 $aXIV, 427 p.$cill.$d24 cm. 620 $aUS$dNew York$3SUNL000011 700 1$aSicard$b, Etienne$3SUNV050128$0300394 701 1$aDelmas Bendhia$b, Sonia$3SUNV050129$0725308 712 $aMcGraw Hill$3SUNV000135$4650 801 $aIT$bSOL$c20181109$gRICA 856 4 $uhttps://books.google.it/books?id=6I8iBAAAQBAJ&printsec=frontcover&hl=it 912 $aSUN0063092 950 $aUFFICIO DI BIBLIOTECA DEI DIPARTIMENTI DI INGEGNERIA$d05 CONS K I 164 $e05 4917 995 $aUFFICIO DI BIBLIOTECA DEI DIPARTIMENTI DI INGEGNERIA$bIT-CE0100$h4917$kCONS K I 164$oc$qa 996 $aBasics of CMOS cell design$91415930 997 $aUNICAMPANIA LEADER 04639nam 22007335 450 001 996466262003316 005 20230221041707.0 010 $a1-280-94953-8 010 $a9786610949533 010 $a3-540-72734-5 024 7 $a10.1007/978-3-540-72734-7 035 $a(CKB)1000000000478515 035 $a(EBL)3061523 035 $a(SSID)ssj0000193911 035 $a(PQKBManifestationID)11208504 035 $a(PQKBTitleCode)TC0000193911 035 $a(PQKBWorkID)10226207 035 $a(PQKB)10179032 035 $a(DE-He213)978-3-540-72734-7 035 $a(MiAaPQ)EBC3061523 035 $a(MiAaPQ)EBC6709004 035 $a(Au-PeEL)EBL6709004 035 $a(PPN)123727723 035 $a(EXLCZ)991000000000478515 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aLogical Foundations of Computer Science$b[electronic resource] $eInternational Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings /$fedited by Sergei Artemov, Anil Nerode 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (521 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4514 300 $aDescription based upon print version of record. 311 $a3-540-72732-9 320 $aIncludes bibliographical references and index. 327 $aJustified and Common Knowledge: Limited Conservativity -- The Intensional Lambda Calculus -- Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers -- Elementary Differential Calculus on Discrete and Hybrid Structures -- Weighted Distributed Systems and Their Logics -- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! -- On Decidability and Expressiveness of Propositional Interval Neighborhood Logics -- Reasoning About Sequences of Memory States -- Cut Elimination in Deduction Modulo by Abstract Completion -- Density Elimination and Rational Completeness for First-Order Logics -- Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus -- Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics -- A Decidable Temporal Logic of Repeating Values -- Model Checking Knowledge and Linear Time: PSPACE Cases -- Realizations and LP -- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking -- Explicit Proofs in Formal Provability Logic -- A Synthesis Algorithm for Hybrid Systems -- Including the Past in ?Topologic? -- A Note on Rewriting Proofs and Fibonacci Numbers -- On Complexity of Ehrenfeucht-Fraïssé Games -- The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion -- Hypersequent Calculus for Intuitionistic Logic with Classical Atoms -- Proof Identity for Classical Logic: Generalizing to Normality -- On the Constructive Dedekind Reals: Extended Abstract -- Verifying Balanced Trees -- Compactness Properties for Stable Semantics of Logic Programs -- Uniform Circuits, & Boolean Proof Nets -- Finite Automata Presentable Abelian Groups -- Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic -- Some Puzzles About Probability and Probabilistic Conditionals -- A Temporal Dynamic Logic for Verifying Hybrid System Invariants -- Multiplexor Categories and Models of Soft Linear Logic -- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms -- Total Public Announcements. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4514 606 $aComputer science 606 $aMachine theory 606 $aMathematical logic 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aMathematical Logic and Foundations 615 0$aComputer science. 615 0$aMachine theory. 615 0$aMathematical logic. 615 14$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aMathematical Logic and Foundations. 676 $a004 702 $aArtemov$b S. N. 702 $aNerode$b Anil$f1932- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466262003316 996 $aLogical Foundations of Computer Science$9772536 997 $aUNISA