Fields of Logic and Computation Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Blass, Andreas (Επιμελητής έκδοσης), Dershowitz, Nachum (Επιμελητής έκδοσης), Reisig, Wolfgang (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
• Σειρά: Lecture Notes in Computer Science, 6300
• Θέματα: Computer science.; Computer communication systems.; Computer programming.; Software engineering.; Algorithms.; Computer logic.; Mathematical logic.; Computer Science.; Programming Techniques.; Logics and Meanings of Programs.; Software Engineering.; Mathematical Logic and Formal Languages.; Algorithm Analysis and Problem Complexity.; Computer Communication Networks.

Yuri 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, fo...

Πίνακας περιεχομένων:

• On 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.