LEADER 01180nam--2200397---450- 001 990000683490203316 005 20060705135442.0 010 $a0-297-76857-3 035 $a0068349 035 $aUSA010068349 035 $a(ALEPH)000068349USA01 035 $a0068349 100 $a20011015d1974----km-y0itay0103----ba 101 $aeng 102 $aGB 105 $a||||||||001yy 200 1 $aSeduction and betrayal$ewomen and literature$fElizabeth Hardwick 210 $aLondon$cWeidenfeld and Nicolson$d1974 215 $aXI, 208 p.$d23 cm 410 $12001 676 $a809.9287 700 1$aHARDWICK,$bElizabeth$0445306 801 0$aIT$bsalbc$gISBD 912 $a990000683490203316 951 $aVIII.3. 1328(Ri B 21)$bLM$cRi B 951 $aVII.3.A. 230a(IIi B 241)$b59962 L.M.$cIIi 959 $aBK 969 $aUMA 979 $aPATTY$b90$c20011015$lUSA01$h2123 979 $c20020403$lUSA01$h1717 979 $aPATRY$b90$c20040406$lUSA01$h1647 979 $aCOPAT5$b90$c20050516$lUSA01$h1727 979 $aCOPAT3$b90$c20050719$lUSA01$h1031 979 $aCOPAT5$b90$c20060705$lUSA01$h1354 996 $aSeduction and betrayal$9960341 997 $aUNISA LEADER 05701nam 22006375 450 001 996465377903316 005 20200705190712.0 010 $a3-540-69065-4 024 7 $a10.1007/3-540-63045-7 035 $a(CKB)1000000000234642 035 $a(SSID)ssj0000324537 035 $a(PQKBManifestationID)11224802 035 $a(PQKBTitleCode)TC0000324537 035 $a(PQKBWorkID)10312558 035 $a(PQKB)10620906 035 $a(DE-He213)978-3-540-69065-8 035 $a(PPN)155203967 035 $a(EXLCZ)991000000000234642 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogical Foundations of Computer Science$b[electronic resource] $e4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings /$fedited by Sergei Adian, Anil Nerode 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (IX, 436 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1234 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-63045-7 327 $aTopological semantics for hybrid systems -- Domain-free pure type systems -- Generic queries over quasi-o-minimal domains -- Towards computing distances between programs via Scott domains -- A safe recursion scheme for exponential time -- Finite model theory, universal algebra and graph grammars -- Complexity of query answering in logic databases with complex values -- Recognition of deductive data base stability -- The concurrency complexity for the Horn fragment of linear logic -- Studying algorithmic problems for free semi-groups and groups -- Learning small programs with additional information -- Cut elimination for the second order propositional logic with Hilbert's ?-symbol, extensionality, and full comprehension -- Finite bases of admissible rules for the logic S52 C -- An algebraic correctness criterion for intuitionistic proof-nets -- Towards a theory of recursive structures -- On the complexity of prefix formulas in modal logic of subset spaces -- The undecidability of second order linear affine logic -- Operational logic of proofs with functionality condition on proof predicate -- On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets -- Functions for the general solution of parametric word equations -- A proof procedure for hereditary Harrop formulas with free equality -- Basic forward chaining construction for logic programs -- Decidability and undecidability of the halting problem on Turing machines, a survey -- Case study: Additive linear logic and lattices -- Some decision problems for traces -- Existential instantiation and strong normalization -- Models for the logic of proofs -- Interpretation of the full computation tree logic CTL* on sets of infinite sequences -- Type introduction for equational rewriting -- Capturing bisimulation-invariant Ptime -- Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic -- A decidable fragment of second order linear logic -- Some results on Propositional Dynamic Logic with fixed points -- Quasi-characteristic inference rules for modal logics -- Provability logic with operations on proofs -- Formal verification of logic programs: Foundations and implementation -- Unification of terms with term-indexed variables -- Back-forth equivalences for design of concurrent systems -- Association nets: An alternative formalization of common thinking -- Simulating ?-expansions with ?-reductions in the second-order polymorphic ?-rcalculus -- Logical schemes for first order theories -- Verification of PLTL formulae by means of monotone disjunctive normal forms. 330 $aThis book constitutes the refereed proceedings of the 4th International Symposium on Logical Foundations of Computer Science, LFCS'97, held in Yaroslavl, Russia, in July 1997. The volume presents 42 revised refereed papers carefully selected by the program committee. All current issues of computer science logic are addressed. There is a certain emphasis on reporting the progress achieved by scientists from various parts of the former Soviet Union; but there are also many other strong papers from the international research community. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1234 606 $aComputers 606 $aMathematical logic 606 $aComputer logic 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 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$aComputers. 615 0$aMathematical logic. 615 0$aComputer logic. 615 14$aTheory of Computation. 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 $aAdian$b Sergei$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNerode$b Anil$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLFCS '97 906 $aBOOK 912 $a996465377903316 996 $aLogical Foundations of Computer Science$9772536 997 $aUNISA LEADER 01062nam a2200265 i 4500 001 991000316809707536 008 090702s2007 gw 001 0 ger d 020 $a9783465040361 035 $ab13840290-39ule_inst 040 $aDip.to Studi Giuridici$bita 082 0 $a340.09 100 1 $aMauthner, Fritz$0471611 245 10$aRecht :$bTexte zum Recht, seiner Geschichte und Sprache /$cFritz Mauthner ; Ausgewählt und mit einer Einleitung versehen von Wolfgang Ernst 260 $aFrankfurt am Main :$bKlostermann,$c2007 300 $av, 209 p. ;$c24 cm 440 0$aStudien zur europäischen Rechtsgeschichte ;$v222 600 14$aErnst von Ysenburg, Wolfgang,$d1560-1633 650 04$aCalvinismo$zGermania$ySec. XVI. 700 1 $aErnst, Wolfgang 907 $a.b13840290$b02-04-14$c02-07-09 912 $a991000316809707536 945 $aLE027 340.03 SER01.01 V. 222$g1$i2027000227594$lle027$o-$pE51.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i15007960$z28-09-09 996 $aRecht$9229327 997 $aUNISALENTO 998 $ale027$b02-07-09$cm$da $e-$fger$ggw $h0$i0