LEADER 04784nam 22007335 450 001 996465600603316 005 20200703012356.0 010 $a3-540-46963-X 024 7 $a10.1007/3-540-52335-9 035 $a(CKB)1000000000233503 035 $a(SSID)ssj0000321897 035 $a(PQKBManifestationID)11230820 035 $a(PQKBTitleCode)TC0000321897 035 $a(PQKBWorkID)10299203 035 $a(PQKB)10878886 035 $a(DE-He213)978-3-540-46963-6 035 $a(PPN)155227181 035 $a(EXLCZ)991000000000233503 100 $a20121227d1990 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCOLOG-88$b[electronic resource] $eInternational Conference on Computer Logic, Tallinn, USSR, December 12-16, 1988, Proceedings /$fedited by Per Martin-Löf, Grigori Mints 205 $a1st ed. 1990. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1990. 215 $a1 online resource (VI, 339 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v417 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-52335-9 327 $aAlgebraic specified processes and enumerable models -- On conditions of full coherence in biclosed categories: A new application of proof theory -- The use of justification systems for integrated semantics -- An equational deductive system for the differential and integral calculus -- Inductively defined types -- Algorithms for probabilistic inference -- Geometry of interaction 2: Deadlock-free algorithms -- On the syntax of infinite objects: an extension of Martin-Löf's theory of expressions -- ?-Reductions and ?-developments of ?-terms with the least number of steps -- Group-theoretic approach to intractable problems -- On some applications of Heyting-valued analysis II -- Mathematics of infinity -- Gentzen-type systems and resolution rules part I propositional logic -- On the problem of reducing search in logic program execution -- Correctness of short proofs in theory with notions of feasibility -- A formulation of the simple theory of types (for Isabelle) -- On connections between classical and constructive semantics -- Flow-diagrams with sets -- The resolution program, able to decide some solvable classes -- A structural completeness theorem for a class of conditional rewrite rule systems -- A proof-search method for the first order logic. 330 $aThis volume contains several invited papers as well as a selection of the other contributions. The conference was the first meeting of the Soviet logicians interested in com- puter science with their Western counterparts. The papers report new results and techniques in applications of deductive systems, deductive program synthesis and analysis, computer experiments in logic related fields, theorem proving and logic programming. It provides access to intensive work on computer logic both in the USSR and in Western countries. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v417 606 $aComputers 606 $aMathematical logic 606 $aPhilosophy and science 606 $aArtificial intelligence 606 $aComputer programming 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aPhilosophy of Science$3https://scigraph.springernature.com/ontologies/product-market-codes/E34000 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 615 0$aComputers. 615 0$aMathematical logic. 615 0$aPhilosophy and science. 615 0$aArtificial intelligence. 615 0$aComputer programming. 615 14$aTheory of Computation. 615 24$aMathematical Logic and Foundations. 615 24$aPhilosophy of Science. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 615 24$aProgramming Techniques. 676 $a004/.01/5113 702 $aMartin-Löf$b Per$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMints$b Grigori$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Computer Logic 906 $aBOOK 912 $a996465600603316 996 $aCOLOG-88$92830484 997 $aUNISA LEADER 02101nam 2200529 a 450 001 9910790132203321 005 20200520144314.0 010 $a1-283-95480-X 010 $a1-78042-546-5 035 $a(CKB)2670000000170792 035 $a(EBL)887048 035 $a(OCoLC)784886893 035 $a(SSID)ssj0000678949 035 $a(PQKBManifestationID)12262240 035 $a(PQKBTitleCode)TC0000678949 035 $a(PQKBWorkID)10737699 035 $a(PQKB)11486995 035 $a(MiAaPQ)EBC887048 035 $a(Au-PeEL)EBL887048 035 $a(CaPaEBR)ebr10540635 035 $a(CaONFJC)MIL426730 035 $a(PPN)25479369X 035 $a(EXLCZ)992670000000170792 100 $a20120328d2003 uy 0 101 0 $aspa 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aAuguste Renoir$b[electronic resource] 210 $a[New York] $cParkstone International$d[2003] 215 $a1 online resource (81 p.) 300 $aDescription based upon print version of record. 311 $a970-718-336-5 320 $aIncludes bibliographical references and index. 327 $aAuguste Renoir; LIST OF ILLUSTRATIONS; NOTES 330 $aPierre-Auguste Renoir nacio? en Limoges, el 25 de febrero de 1841. En 1854, sus padres lo sacaron de la escuela y le consiguieron un sitio en el taller de los hermanos Le?vy, donde aprendio? a pintar porcelana. El hermano menor de Renoir, Edmond, opino? al respecto: "A partir de lo que pintaba al carbo?n en las paredes concluyeron que teni?a habilidad para las artes. Asi? fue como nuestros padres lo pusieron a aprender el oficio de pintor de porcelana". Uno de los trabajadores de los Le?vy, Emile Laporte, pintaba al o?leo en su tiempo libre. E?l le sugirio? a Renoir que usara sus lienzos y pinturas. Este 606 $aPainters$zFrance$vBiography 615 0$aPainters 676 $a759.4 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910790132203321 996 $aAuguste Renoir$93675780 997 $aUNINA