LEADER 01029nam0-22002771i-450- 001 990005653810403321 005 19990530 035 $a000565381 035 $aFED01000565381 035 $a(Aleph)000565381FED01 035 $a000565381 100 $a19990530d1936----km-y0itay50------ba 101 0 $aita 105 $ay-------001yy 200 1 $a<>problemi della filosofia del diritto nel pensiero dei giorni$eDieci anni di esercitazione nella R. Universita di Roma (1926-1935)$fa cura del Prof. Giorgio Del Vecchio 210 $aRoma$cSocieta editrice del "Foro Italiano"$d1936 215 $a219 p.$d26 cm 225 1 $aPubblicazioni dell'Istituto di filosofia del diritto della R. Università di Roma$v2 700 1$aDel Vecchio,$bGiorgio$f<1878-1970>$0159214 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990005653810403321 952 $aNON CONSULTABILE$bIST.ST.FIL. 5052$fFLFBC 959 $aFLFBC 996 $aProblemi della filosofia del diritto nel pensiero dei giorni$9605708 997 $aUNINA LEADER 03450oam 2200577 450 001 9910144420703321 005 20210714084605.0 010 $a3-540-48855-3 024 7 $a10.1007/10703163 035 $a(CKB)1000000000575763 035 $a(SSID)ssj0000322130 035 $a(PQKBManifestationID)11233016 035 $a(PQKBTitleCode)TC0000322130 035 $a(PQKBWorkID)10280820 035 $a(PQKB)11170315 035 $a(DE-He213)978-3-540-48855-2 035 $a(MiAaPQ)EBC3087438 035 $a(MiAaPQ)EBC6486079 035 $a(PPN)155197894 035 $a(EXLCZ)991000000000575763 100 $a20210714d1999 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aComputer science logic $e12th international workshop, csl'98, annual conference of the eacsl, brno, czech republic, august 24-28, 1998, proceedings /$fedited by Georg Gottlob, Etienne Grandjean, Katrin Seyr 205 $a1st ed. 1999. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[1999] 210 4$d©1999 215 $a1 online resource (X, 442 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1584 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-65922-6 320 $aIncludes bibliographical references. 327 $aInvited Papers -- Trakhtenbrot Theorem and Fuzzy Logic -- Descriptive Complexity, Lower Bounds and Linear Time -- Testing of Finite State Systems -- Contributed Papers -- On the Power of Quantifiers in First-Order Algebraic Specification -- On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases -- Revision Programming = Logic Programming + Integrity Constraints -- Quantifiers and the System KE: Some Surprising Results -- Choice Construct and Lindström Logics -- Monadic NP and Graph Minors -- Invariant Definability and P/poly -- Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures -- An Upper Bound for Minimal Resolution Refutations -- On an Optimal Deterministic Algorithm for SAT -- Characteristic Properties of Majorant-Computability Over the Reals -- Theorems of Péter and Parsons in Computer Programming -- Kripke, Belnap, Urquhart and Relevant Decidability & Complexity -- Existence and Uniqueness of Normal Forms in Pure Type Systems with ??-conversion -- Normalization of Typable Terms by Superdevelopments -- Subtyping Functional+Nonempty Record Types -- Monotone Fixed-Point Types and Strong Normalization -- Morphisms and Partitions of V-sets -- Computational Adequacy in an Elementary Topos -- Logical Relations and Inductive/Coinductive Types -- On the Complexity of H-Subsumption -- Complexity Classes and Rewrite Systems with Polynomial Interpretation -- RPO Constraint Solving Is in NP -- Quantifier Elimination in Fuzzy Logic -- Many-Valued First-Order Logics with Probabilistic Semantics. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1584 606 $aComputer logic$vCongresses 615 0$aComputer logic 676 $a004.015113 702 $aSeyr$b Katrin 702 $aGottlob$b G$g(Georg), 702 $aGrandjean$b Etienne 712 12$aWorkshop on Computer Science Logic 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910144420703321 996 $aComputer Science Logic$9771972 997 $aUNINA