000 04468nam a22006135i 4500
001 978-3-642-15025-8
003 DE-He213
005 20140220084544.0
007 cr nn 008mamaa
008 100816s2010 gw | s |||| 0|eng d
020 _a9783642150258
_9978-3-642-15025-8
024 7 _a10.1007/978-3-642-15025-8
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
100 1 _aBlass, Andreas.
_eeditor.
245 1 0 _aFields of Logic and Computation
_h[electronic resource] :
_bEssays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday /
_cedited by Andreas Blass, Nachum Dershowitz, Wolfgang Reisig.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXIII, 627p. 49 illus.
_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 ;
_v6300
505 0 _aOn Yuri Gurevich -- Yuri, Logic, and Computer Science -- Database Theory, Yuri, and Me -- Technical Papers -- Tracking Evidence -- Strict Canonical Constructive Systems -- Decidable Expansions of Labelled Linear Orderings -- Existential Fixed-Point Logic, Universal Quantifiers, and Topoi -- Three Paths to Effectiveness -- The Quest for a Tight Translation of Büchi to co-Büchi Automata -- Normalization of Some Extended Abstract State Machines -- Finding Reductions Automatically -- On Complete Problems, Relativizations and Logics for Complexity Classes -- Effective Closed Subshifts in 1D Can Be Implemented in 2D -- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey -- A Logic for PTIME and a Parameterized Halting Problem -- Inferring Loop Invariants Using Postconditions -- ASMs and Operational Algorithmic Completeness of Lambda Calculus -- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs -- Ibn S?n? on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic -- Abstract State Machines and the Inquiry Process -- The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion -- Definability of Combinatorial Functions and Their Linear Recurrence Relations -- Halting and Equivalence of Program Schemes in Models of Arbitrary Theories -- Metrization Theorem for Space-Times: From Urysohn’s Problem towards Physically Useful Constructive Mathematics -- Thirteen Definitions of a Stable Model -- DKAL and Z3: A Logic Embedding Experiment -- Decidability of the Class E by Maslov’s Inverse Method -- Logics for Two Fragments beyond the Syllogistic Boundary -- Choiceless Computation and Symmetry -- Hereditary Zero-One Laws for Graphs -- On Monadic Theories of Monadic Predicates.
520 _aThis Festschrift volume, published in honor of Yuri Gurevich on the occasion of his 70th birthday, contains contributions, written by his colleagues. The collection of articles herein begins with an academic biography, an annotated list of Yuri's publications and reports, and a personal tribute by Jan Van den Bussche. These are followed by 28 technical contributions. These articles - though they cover a broad range of topics - represent only a fraction of Yuri Gurevich’s multiple areas of interest.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aSoftware engineering.
650 0 _aComputer software.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputer Communication Networks.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
700 1 _aDershowitz, Nachum.
_eeditor.
700 1 _aReisig, Wolfgang.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642150241
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6300
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-15025-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112572
_d112572