LEADER 05196nam 2200601Ia 450 001 9910483367003321 005 20200520144314.0 010 $a1-280-38827-7 010 $a9786613566195 010 $a3-642-15025-X 024 7 $a10.1007/978-3-642-15025-8 035 $a(CKB)2670000000036372 035 $a(SSID)ssj0000446465 035 $a(PQKBManifestationID)11312979 035 $a(PQKBTitleCode)TC0000446465 035 $a(PQKBWorkID)10506316 035 $a(PQKB)11662671 035 $a(DE-He213)978-3-642-15025-8 035 $a(MiAaPQ)EBC3065652 035 $a(PPN)14901807X 035 $a(EXLCZ)992670000000036372 100 $a20100706d2010 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aFields of logic and computation $eessays dedicated to Yuri Gurevich on the occassion of his 70th birthday /$fAndreas Blass, Nachum Dershowitz, Wolfgang Reisig (eds.) 205 $a1st ed. 2010. 210 $aBerlin ;$aNew York $cSpringer$dc2010 215 $a1 online resource (XIII, 627 p. 49 illus.) 225 1 $aLecture notes in computer science ;$v6300 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-15024-1 320 $aIncludes bibliographical references and index. 327 $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. 330 $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. 410 0$aLecture notes in computer science ;$v6300. 606 $aComputer algorithms 606 $aLogic, Symbolic and mathematical 615 0$aComputer algorithms. 615 0$aLogic, Symbolic and mathematical. 676 $a004.0151 701 $aBlass$b Andreas$f1947-$0321690 701 $aDershowitz$b Nachum$01354752 701 $aReisig$b Wolfgang$f1950-$050121 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483367003321 996 $aFields of logic and computation$94203365 997 $aUNINA