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

Fields of Logic and Computation Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday / edited by Andreas Blass, Nachum Dershowitz, Wolfgang Reisig.

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

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Blass, Andreas (Editor), Dershowitz, Nachum (Editor), Reisig, Wolfgang (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edition:1st ed. 2010.
Series:Programming and Software Engineering ; 6300
Springer eBook Collection.
Subjects:
Computer programming.
Computer logic.
Software engineering.
Mathematical logic.
Algorithms.
Computer communication systems.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items