Andreas Blass, Nachum Dershowitz, Wolfgang Reisig (Eds.):
Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday.
Lecture Notes in Computer Science 6300 Springer 2010, ISBN 978-3-642-15024-1
On Yuri Gurevich
Technical Papers
- Sergei N. Artëmov:
Tracking Evidence.
61-74
- Arnon Avron, Ori Lahav:
Strict Canonical Constructive Systems.
75-94
- Alexis Bès, Alexander Rabinovich:
Decidable Expansions of Labelled Linear Orderings.
95-107
- Andreas Blass:
Existential Fixed-Point Logic, Universal Quantifiers, and Topoi.
108-134
- Udi Boker, Nachum Dershowitz:
Three Paths to Effectiveness.
135-146
- Udi Boker, Orna Kupferman:
The Quest for a Tight Translation of Büchi to co-Büchi Automata.
147-164
- Patrick Cégielski, Irène Guessarian:
Normalization of Some Extended Abstract State Machines.
165-180
- Michael Crouch, Neil Immerman, J. Eliot B. Moss:
Finding Reductions Automatically.
181-200
- Anuj Dawar:
On Complete Problems, Relativizations and Logics for Complexity Classes.
201-207
- Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Effective Closed Subshifts in 1D Can Be Implemented in 2D.
208-226
- Thomas Eiter, Georg Gottlob, Thomas Schwentick:
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey.
227-250
- Yijia Chen, Jörg Flum:
A Logic for PTIME and a Parameterized Halting Problem.
251-276
- Carlo A. Furia, Bertrand Meyer:
Inferring Loop Invariants Using Postconditions.
277-300
- Marie Ferbus-Zanda, Serge Grigorieff:
ASMs and Operational Algorithmic Completeness of Lambda Calculus.
301-327
- Martin Grohe:
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs.
328-353
- Wilfrid Hodges:
Ibn Sina on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic.
354-404
- James K. Huggins, Charles Wallace:
Abstract State Machines and the Inquiry Process.
405-413
- Marcel Jackson, Mikhail V. Volkov:
The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion.
414-443
- Tomer Kotek, Johann A. Makowsky:
Definability of Combinatorial Functions and Their Linear Recurrence Relations.
444-462
- Dexter Kozen:
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories.
463-469
- Vladik Kreinovich:
Metrization Theorem for Space-Times: From Urysohn's Problem towards Physically Useful Constructive Mathematics.
470-487
- Vladimir Lifschitz:
Thirteen Definitions of a Stable Model.
488-503
- Sergio Mera, Nikolaj Bjørner:
DKAL and Z3: A Logic Embedding Experiment.
504-528
- Grigori Mints:
Decidability of the Class E by Maslov's Inverse Method.
529-537
- Lawrence S. Moss:
Logics for Two Fragments beyond the Syllogistic Boundary.
538-564
- Benjamin Rossman:
Choiceless Computation and Symmetry.
565-580
- Saharon Shelah, Mor Doron:
Hereditary Zero-One Laws for Graphs.
581-614
- Wolfgang Thomas:
On Monadic Theories of Monadic Predicates.
615-626
Last update Tue May 22 23:23:09 2012
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page