• Publications
  • Influence
Annals of Pure and Applied Logic
A new process logic is defined, called computation paths logic (CPL). which treats lbnn~~la~ and programs essentially alike. CPL is a pathwlse extension of PDL. following the basic pt-ocess logic ofExpand
Evolving algebras 1993: Lipari guide
  • Y. Gurevich
  • Computer Science, Mathematics
  • Specification and validation methods
  • 14 September 1995
TLDR
Details of Static Algebras, Conservative Determinism vs. Local Nondeterminism, and Locations and Updates can be found here. Expand
The Classical Decision Problem
TLDR
The Undecidable Standard Classes for Pure Predicate Logic, a Treatise on the Transformation of the Classical Decision Problem, and some Results and Open Problems are presented. Expand
Sequential abstract-state machines capture sequential algorithms
TLDR
Analysis of the postulates leads to the notion of sequential abstract-state machine and to the theorem in the title. Expand
The Classical Decision Problem
1. Introduction: The Classical Decision Problem.- 1.1 The Original Problem.- 1.2 The Transformation of the Classical Decision Problem.- 1.3 What Is and What Isn't in this Book.- I. UndecidableExpand
On Finite Model Theory
The subject of this paper is the part of finite model theory intimately related to the classical model theory. In the very beginning of our career in computer science, we attended a few lectures onExpand
Abstract state machines capture parallel algorithms
TLDR
It is shown that every parallel, synchronous algorithm can be simulated, step for step, by an abstract state machine with a background that provides for multisets. Expand
Logic in Computer Science
  • Y. Gurevich
  • Computer Science
  • Current Trends in Theoretical Computer Science
  • 1993
TLDR
The logic in computer science is one of the literary work in this world in suitable to be reading material and this book gives reference, but also it will show the amazing benefits of reading a book. Expand
Trees, automata, and games
TLDR
This work gives here an alternative and transparent proof of Rabin's result on tree automata, which is based on ideas of his predecessors and especially those of B- and-uuml;chi-&-mdash;. Expand
On polynomial time computation over unordered structures
TLDR
It is shown that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a complete matching in a bipartite graph. Expand
...
1
2
3
4
5
...