000 05776nam a22006375i 4500
001 978-3-642-15025-8
003 DE-He213
005 20240730184151.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.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
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.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXIII, 627 p. 49 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aProgramming and Software Engineering,
_x2945-9168 ;
_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 _aYuri Gurevich has played a major role in the discovery and development of - plications of mathematical logic to theoretical and practical computer science. His interests have spanned a broad spectrum of subjects, including decision p- cedures, the monadic theory of order, abstract state machines, formal methods, foundations of computer science, security, and much more. In May 2010, Yuri celebrated his 70th birthday. To mark that occasion, on August 22, 2010,a symposium was held in Brno, the Czech Republic, as a sat- lite event of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010) and of the 19th EACSL Annual Conference on Computer Science Logic (CSL 2010). The meeting received generous support from Microsoft Research. In preparation for this 70th birthday event, we asked Yuri's colleagues (whether or not they were able to attend the symposium) to contribute to a volume in his honor. This book is the result of that e?ort. The collection of articles herein begins with an academic biography, an annotated list of Yuri's publications and reports, and a personaltribute 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's multiple areas of interest. Each contribution was reviewed by one or two readers. In this regard, the editors wish to thank several anonymous individuals for their assistance.
650 0 _aComputer programming.
_94169
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aMachine theory.
_9134719
650 0 _aAlgorithms.
_93390
650 0 _aComputer networks .
_931572
650 1 4 _aProgramming Techniques.
_9134720
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aFormal Languages and Automata Theory.
_9134721
650 2 4 _aAlgorithms.
_93390
650 2 4 _aComputer Communication Networks.
_9134722
700 1 _aBlass, Andreas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134723
700 1 _aDershowitz, Nachum.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134724
700 1 _aReisig, Wolfgang.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9134725
710 2 _aSpringerLink (Online service)
_9134726
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642150241
776 0 8 _iPrinted edition:
_z9783642150265
830 0 _aProgramming and Software Engineering,
_x2945-9168 ;
_v6300
_9134727
856 4 0 _uhttps://doi.org/10.1007/978-3-642-15025-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92217
_d92217