01259nam--2200373---450-99000181842020331620050329145409.0000181842USA01000181842(ALEPH)000181842USA0100018184220040705d19771961km-y0itay0103----baitaIT||||||||001yyEretici e inquiaitori nella società piemontese del Trecentocon l'edizione dei processi tenuti a Giaveno dall'Inquisitore Alberto de Castellario (1335) e nelle valli di Lanzo dall'Inquisitore Tommaso di Casasco (1373)TorinoClaudiana1977316 p.ill.24 cmStudi storici1Studi storici200112001001-------2001273MERLO,Grado G.162577ITsalbcISBD990001818420203316II.2. 569(III A Coll. 145/1)79477 L.M.III A Coll.BKUMASIAV11020040705USA010930COPAT39020050329USA011454PATRY9020120224USA011346Eretici e inquiaitori nella società piemontese del Trecento950730UNISA03450oam 2200577 450 991014442070332120210714084605.03-540-48855-310.1007/10703163(CKB)1000000000575763(SSID)ssj0000322130(PQKBManifestationID)11233016(PQKBTitleCode)TC0000322130(PQKBWorkID)10280820(PQKB)11170315(DE-He213)978-3-540-48855-2(MiAaPQ)EBC3087438(MiAaPQ)EBC6486079(PPN)155197894(EXLCZ)99100000000057576320210714d1999 uy 0engurnn|008mamaatxtccrComputer science logic 12th international workshop, csl'98, annual conference of the eacsl, brno, czech republic, august 24-28, 1998, proceedings /edited by Georg Gottlob, Etienne Grandjean, Katrin Seyr1st ed. 1999.Berlin, Germany ;New York, New York :Springer,[1999]©19991 online resource (X, 442 p.) Lecture Notes in Computer Science,0302-9743 ;1584Bibliographic Level Mode of Issuance: Monograph3-540-65922-6 Includes bibliographical references.Invited 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.Lecture Notes in Computer Science,0302-9743 ;1584Computer logicCongressesComputer logic004.015113Seyr KatrinGottlob G(Georg),Grandjean EtienneWorkshop on Computer Science LogicMiAaPQMiAaPQUtOrBLWBOOK9910144420703321Computer Science Logic771972UNINA