Gurevich 1988 Yuri Gurevich, "Logic and the Challenge of Computer Science", In "Current Trends in Theoretical Computer Science" (Ed. E. Borger), Computer Science Press, 1988, 1--57. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
An ASM Dynamic Semantics for Standard ML - Cater, Huggins (1 citation) (Correct)
....e#ect of a Standard ML instruction can be seen in terms of the corresponding actions performed by the ASM. 1 Introduction The Abstract State Machines (ASM) methodology [Gur95] is a methodology for formally specifying computing systems (software, hardware, or mixed) First introduced by Gurevich [Gur88] (under their former name, evolving algebras ) the ASM methodology is mathematically precise, yet general enough to be applicable to a wide variety of problem domains [BH98,Gla,Hug] The ASM Thesis [Gur00] asserts that any computing system can be described at its natural level of abstraction by ....
Y. Gurevich. Logic and the Challenge of Computer Science. In E. Borger, editor, Current Trends in Theoretical Computer Science, pages 1--57. Computer Science Press, 1988.
Design for Reuse via Structuring Techniques for ASMs - Börger (2001) (Correct)
.... been built around the i In embryo the notion appeared under the name of dynamic evolving struc tures algebras in a Technical Report in 1984 [22] a year later in a note to the American Mathematical Society [23] I learnt it in the Spring of 1987 from the simple examples which appeared latex in [24] to illustrate the concept, see [6] fox a more detailed historical account. The fn st complete definition, which essentially remained stable since then, appeared in [26] and in a preliminary form in [25] 2 Before, in the summer of 1990 in a diploma thesis at the University of Dortmund [30] ....
Y. Gurevich. Logic and the Challenge of Computer Science. In E. BSrger, editor, Current Trends in Theoretical Computer Science, pages 1-57. Computer Science Press, 1988.
Finite Model Theory and Descriptive Complexity - Grädel (2002) (Correct)
.... logic for PTIME To discuss the problem whether PTIME can be captured on the domain of all finite structures, we need to make precise the notion of a logic, and to refine the notion of a logic capturing a complexity class, so as to exclude pathological examples like the following, due to Gurevich [56]. Example 5.28. Let the syntax of our logic consist of all pairs (M, k) where M is a Turing machine, and k a natural number. A finite r structure 9A is a model of (M, k) if there exists a model class C C Fin(r) such that 9A C, and M accepts an encoding code(3, of a finite r structure 3 in ....
Y. GUREVICH, Logic and the challenge of computer science, in Current Trends in Theoretical Computer Science, E. Brrger, ed., Computer Science Press, 1988, pp. 1-57.
The Formal Definition of Anlauff's eXtensible Abstract State.. - Kutter (2002) (1 citation) (Correct)
....a formal semantics of XASM has not been given up to now. We streamline Anlauff s original design and present a denotational semantics, complementing the existing informal description. In fact we found that XASM implement a semantic generalization of Gurevich s Abstract State Machines (ASMs) [13, 14, 15, 16]. The initial idea for this generalization came from May s work [22] which is the first paper formalizing sequential composition, iteration and hierarchical structuring of ASMs. May notes that his approach complements . the method of refining Evolving Algebras by different abstraction levels ....
....of the thesis for sequential algorithms is given, and in [5] the corresponding proof for parallel algorithms is shown. 18 This pure mathematical program, has been implicitly transformed in a computer science project, by defining a concrete rule language for defining the update sets. While in [13, 14] Gurevich is investigating the concept of dynamically changeable Tarski structures, later in [15] he defines a set of fixed, minimal languages for defining rules. ASMs are defined to correspond to this rule programming languages, and under this interpretation the thesis has subsequently provoked a ....
[Article contains additional citation context not shown here]
Y. Gurevich. Logic and the Challenge of Computer Science. In E. Borger, editor, Theory and Practice of Software Engineering, pages 1--57. CS Press, 1988.
Implicit Definability and Infinitary Logic in Finite Model.. - Dawar, al. (8 citations) (Correct)
....to the resources needed to express such problems in various logical formalisms. One of the most notable successes of descriptive complexity is the discovery that essentially all major complexity classes have natural characterizations in terms of logical expressibility on nite structures (cf. [Gur88,Imm89]) The prototypical result in this vein is Fagin s theorem [Fag74] which asserts that a class of nite structures is in NP if and only if it is de nable by a formula of existential second order logic. Quite often, certain logical characterizations of other major complexity classes are valid only ....
Y. Gurevich. Logic and the challenge of computer science. In E. Borger, editor, Current trends in theoretical computer science, pages 1-57, Computer Science Press, 1988.
Pseudo-Finite Model Theory - Väänänen (2001) (Correct)
....nite structures, see [10] and [4] We use common model theoretic notation, as e.g. in [9] When we talk about nite structures we do not assume that the vocabulary is necessarily nite. 2 Examples Pseudo nite models can be and have been used to prove results about nite structures. Gurevich [7] proved by means of Ehrenfeucht Fraisse games that even cardinality is not expressible in rst order logic on ordered structures. One can alternatively use UP nite models to prove this result. Let An be the linear order hf1; ng; i. It is easy to see that if A = Y n A 2n =F ; B = ....
Yuri Gurevich. Logic and the challenge of computer science. In Trends in theoretical computer science (Udine,
Choiceless Polynomial Time - Andreas Blass Yuri (1997) (4 citations) Self-citation (Gurevich) (Correct)
No context found.
Gurevich 1988 Yuri Gurevich, "Logic and the Challenge of Computer Science", In "Current Trends in Theoretical Computer Science" (Ed. E. Borger), Computer Science Press, 1988, 1--57.
Evolving Algebras 1993: Lipari Guide - Gurevich (1995) (64 citations) Self-citation (Gurevich) (Correct)
No context found.
Yuri Gurevich, "Logic and the challenge of computer science", In "Current Trends in Theoretical Computer Science", Ed. E. Borger, Computer Science Press, 1988, 1--57.
Algebraic Operational Semantics and Modula-2* - Yuri Gurevich And Self-citation (Yuri) (Correct)
No context found.
Gurevich, Yuri, "Logic and the Challenge of Computer Science", in Current Trends in Theoretical Computer Science (ed. E. Brger), Computer Science Press, 1987, 1-57.
The Logic of Choice - Andreas Blass Math Self-citation (Gurevich) (Correct)
No context found.
Gurevich 1988 Yuri Gurevich, "Logic and the challenge of computer science", in E. Borger, editor, "Current Trends in Theoretical Computer Science", Computer Science Press, 1988, 1--57.
Unknown - Incomd Sciencecolum By Self-citation (Gurevich) (Correct)
No context found.
Gurevich1988a Yuri Gurevich, "Logic and the challenge of computer science", in E. Borger (editor), "Current Trends in Theoretical Computer Science", Computer Science Press, 1988, 1--57.
Equivalence Is In The Eye Of The Beholder - Yuri Gurevich And (3 citations) Self-citation (Gurevich) (Correct)
No context found.
Y. Gurevich, "Logic and the challenge of computer science." In E. Borger, editor, Current Trends in Theoretical Computer Science, pp. 1--57, Computer Science Press, 1988. 32
On Finite Rigid Structures - Yuri Gurevich Saharon (1996) (10 citations) Self-citation (Gurevich) (Correct)
No context found.
G Yuri Gurevich, "Logic and the challenge of computer science", In "Current Trends in Theoretical Computer Science" (Ed. E. Borger), Computer Science Press, 1988, 1--57.
Metafinite Model Theory - Erich Gradel Yuri (1995) (1 citation) Self-citation (Gurevich) (Correct)
No context found.
Y. Gurevich, Logic and the Challenge of Computer Science, in: E. Borger (Ed), Trends in Theoretical Computer Science, Computer Science Press (1988), 1--57.
Existential Second-Order Logic over Strings - Eiter, Gottlob, Gurevich (1998) (5 citations) Self-citation (Gurevich) (Correct)
.... of total and partial fixpoint queries coincide on arbitrary finite structures if and only if P = PSPACE (see [1] Many complexity classes, including LOGSPACE and NLOGSPACE, were logically characterized by Immerman [24] Most of these results and many others are covered by the books or surveys [26, 11, 21, 17]. Our results add to previous knowledge about the relationships between nonmonadic ESO fragments and MSO over strings. They contrast with previous results on graphs. We show that existential MSO and ) coincide over strings. This is not true for graphs. It was known that over finite graphs, ....
Y. Gurevich. Logic and the Challenge of Computer Science. In E. Borger, editor, Trends in Theoretical Computer Science, chapter 1. Computer Science Press, 1988.
Existential Second-Order Logic over Strings (Extended.. - Eiter, Gottlob, Gurevich (1997) (Correct)
No context found.
Y. Gurevich. Logic and the Challenge of Computer Science. In E. Borger (ed), Trends in Theoretical Computer Science, CS Press, 1988.
Definability on Finite Structures and the - Existence Of One-Way (Correct)
No context found.
Y. Gurevich, Logic and the Challenge of Computer Science, in: "Trends in Theoretical Computer Science" (E. Borger, Ed.), Computer Science Press (1988), 1--57.
Ptime Canonization for Two Variables with Counting - Otto Mathematische Grundlagen (1995) (9 citations) (Correct)
No context found.
Y. Gurevich, Logic and the Challenge of Computer Science, in: E. Borger (ed), Trends in Theoretical Computer Science, Computer Science Press (1988), 1-57.
A Survey on Real Structural Complexity Theory - Meer, Michaux (1996) (7 citations) (Correct)
No context found.
Y. Gurevich, Logic and the challenge of computer science, in: E. Boerger (ed.), Trends in Theoretical Computer Science, Computer Science Press (1988), 1-57 22
Proving the Correctness of the Static Link Technique Using.. - Mohnen (1994) (Correct)
No context found.
Y. Gurevich. Logic and the Challenge of Computer Science. In E. Borger, editor, Trends in theoretical computer science, pages 1--57. Computer Science Press, 1988.
Fixed-Point Logics, Descriptive Complexity, And Random.. - Atserias (2002) (Correct)
No context found.
Y. Gurevich. Logic and the challenge of computer science. In E. Borger, editor, Current Trends in Theoretical Computer Science, pages 1--57. Computer Science Press, 1988.
A Programming Language For Local - Computations In Graphs (Correct)
No context found.
Y. Gurevich. Logic and the challenge of computer science. In E. Brger, editor, Current trends in theoretical computer science., pages 157, 1988.
Sharply Bounded Alternation within P - Bloch (1995) (2 citations) (Correct)
No context found.
Y. Gurevich, "Logic and the challenge of computer science," in E. Borger, ed., Current Trends in Theoretical Computer Science, Computer Science Press, 1987, pp. 1--57.
A Survey on Real Structural Complexity Theory - Meer, Michaux (1997) (7 citations) (Correct)
No context found.
Y. Gurevich, Logic and the challenge of computer science, in: E. Boerger (ed.), Trends in Theoretical Computer Science, Computer Science Press (1988), 1-- 57.
The validation of a bidirectional serial/parallel shift.. - Giampaolo Bella Elvinia (Correct)
No context found.
Y. Gurevich. Logic and the challenge of computer science. In E. Borger, editor, Current Trends in Theoretical Computer Science, Computer Science Press, 1988.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC