000 | 03679nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-3-540-46963-6 | ||
003 | DE-He213 | ||
005 | 20160624102019.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1990 gw | s |||| 0|eng d | ||
020 |
_a9783540469636 _9978-3-540-46963-6 |
||
024 | 7 |
_a10.1007/3-540-52335-9 _2doi |
|
050 | 4 | _aQA8.9-QA10.3 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
082 | 0 | 4 |
_a005.131 _223 |
245 | 1 | 0 |
_aCOLOG-88 _h[electronic resource] : _bInternational Conference on Computer Logic Tallinn, USSR, December 12–16, 1988 Proceedings / _cedited by Per Martin-Löf, Grigori Mints. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1990. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1990. |
|
300 |
_aVI, 339 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v417 |
|
505 | 0 | _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. | |
520 | _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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aSoftware Engineering. |
700 | 1 |
_aMartin-Löf, Per. _eeditor. |
|
700 | 1 |
_aMints, Grigori. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540523352 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v417 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-52335-9 |
942 |
_2EBK5942 _cEBK |
||
999 |
_c35236 _d35236 |