- Definability on -Automatic Structures Faried Abu Zaid
- Fine Hierarchies of Generic Computation ? Jerzy Tyszkiewicz
- Will Deflation Lead to Depletion? On NonMonotone Fixed Point Inductions
- Von der Fakultt fr Mathematik, Informatik und Naturwissenscha en der RWTH Aachen University zur Erlangung des akademischen Grades
- Wied Pakusa Finite Model Theory with
- Game Quantification on Automatic Structures and Hierarchical Model Checking Games
- A normal form for Borel sets (extended abstract)
- On the Decision Problem for TwoVariable FirstOrder Logic
- [7] H. Sahlqvist. Completeness and correspondence in the first and second order semantics for modal logic. In S. Kanger, editor, Proceedings of the Third
- Quantum Computing and Abstract State E. Gradel and A. Nowack
- Playing General Structure Rewriting Games Lukasz Kaiser
- Confluence of right ground term rewriting systems is decidable
- Complexity Theory via Abstract State Antje Nowack
- SO(89 \Lambda ) sentences and their asymptotic
- Twovariable descriptions of regularity Erich Gradel Eric Rosen
- Model Checking Abstract State Machines Marc Spielmann
- Slicing Abstract State Machines Antje Nowack
- Decidability issues for action guarded logics Elisabeth Goncalves Erich Gradel
- Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines
- Finite Presentations of Infinite Structures : Automata and Interpretations
- Invariants of Automatic Presentations and Semi-Synchronous Transductions
- Guarded xed point logics and the monadic theory of countable trees
- Optimization Problems with Approximation Anders Malmstrom
- A hierarchy of Deterministic Context-free !-languages Equipe de Logique Math emathique,
- Verification of Relational Transducers for Electronic Commerce
- Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closure Logic
- On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering ?
- The normal form of Borel sets Part II : Borel sets of infinite rank \Lambda
- Rheinisch-Westfalische Technische Hochschule Aachen Lehr-und Forschungsgebiet Mathematische Grundlagen der Informatik
- "memorykinds" --2007/6/6 --11:40 --page 1 --#1 What kind of memory is needed to win infinitary
- Recursive Abstract State Machines Yuri Gurevich 1
- On preservation theorems for twovariable logic Erich Gradel and Eric Rosen
- Back and Forth Between Guarded and Modal Logics 1
- Descriptive Complexity Theory over the Real Numbers \Lambda
- Back and Forth Between Guarded and Modal Logics Erich Gradel \Lambda Colin Hirsch \Lambda Martin Otto +
- Two-Variable Logic with Counting is Decidable Erich Gradel Martin Otto Eric Rosen
- Optimization Problems: Expressibility, Approximation Properties and Expected
- Wadge hierarchy and Veblen hierarchy. Part II: Borel sets of infinite rank \Lambda
- Automata-based presentations of infinite Vince Barany and Erich Gradel and Sasha Rubin
- Eliminating recursion in the calculus ? Martin Otto
- Tailoring recursion for complexity \Lambda Erich Gradel
- Why are modal logics so robustly decidable? Erich Gradel
- The Kolmogorov Expression Complexity of Logics Jerzy Tyszkiewicz \Lambda
- Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex
- On the Power of Deterministic Transitive Closures \Lambda Erich Gradel y Gregory L. McColm z
- Automatic Structures Achim Blumensath and Erich Grdel
- Approximable minimization problems and optimal solutions on random inputs
- Positional Determinacy of In nite Games ? Erich Gradel 1
- On Asymptotic Probabilities of Monadic Second Order Properties appeared in: Proc. CSL'92, Springer Lecture Notes in Comp. Sci. 702, pp. 425439
- The Complexity of Query Reliability Erich Gradel
- Undecidability Results on TwoVariable Logics \Lambda
- Logspace Reducibility via Abstract State Machines
- Electronic Notes in Theoretical Computer Science 67 (2002) URL: http://www.elsevier.nl/locate/entcs/volume67.html 20 pages
- Backtracking games and in ationary xed points Anuj Dawar 1 , Erich Gradel 2 , and Stephan Kreutzer 3
- Guarded Fixed Point Logic Erich Gradel 1
- Two Variable FirstOrder Logic over Ordered Domains Martin Otto
- Guarded Fragments of FirstOrder Logic: A Perspective for New Description Logics?
- Fixed point formulae and solitaire games Dietmar Berwanger and Erich Gradel
- Descriptive Complexity Theory for Constraint Erich Gradel and Stephan Kreutzer
- Descriptive Complexity Theory over the Real Numbers Erich Gradel \Lambda Klaus Meer y
- Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic \Lambda
- Guarded Logics: Algorithms and Bisimulation
- In ationary Fixed Points in Modal Logic A. Dawar 1;? , E. Gradel 2 , and S. Kreutzer 2
- RheinischWestfalische Technische Hochschule Aachen
- Games and Model Checking for Guarded Logics
- Datalog LITE: A deductive query language with linear time model checking
- FixedPoint Query Languages for Linear Constraint Stephan Kreutzer
- Information Tracking in Games on Graphs Dietmar Berwanger1
- On the rst-order pre x hierarchy RWTH Aachen, Germany
- BisimulationInvariant Ptime and HigherDimensional Martin Otto
- 01 Laws for Recursive Structures \Lambda Erich Gradel Anders Malmstrom
- Ptime Canonization for Two Variables with Counting Mathematische Grundlagen der Informatik
- Definability on Finite Structures and the Existence of OneWay Functions
- Decision procedures for guarded logics Erich Gradel
- POSITIONAL DETERMINACY OF GAMES WITH INFINITELY MANY ERICH GRADEL AND IGOR WALUKIEWICZ
- The Complexity of Finding Reset Words in Finite Automata
- Metafinite Model Theory \Lambda Erich Gradel y Yuri Gurevich z
- The Steel Hierarchy of Ordinal Valued Borel Mappings Equipe de Logique Math emathique,
- Anti-chains of mappings from ! ! on some BQO Equipe de Logique Math emathique,
- Symposium on Theoretical Aspects of Computer Science 2008 (Bordeaux), pp. 313-324 www.stacs-conf.org
- A Guarded Fragment for Abstract State Antje Nowack
- Wadge degrees of Louveau's (Wadge) classes Equipe de Logique Math'emathique,
- Bounded Arithmetic and Descriptive Complexity Achim Blumensath
- Model Checking Games for the Quantitative -Calculus
- Directed Graphs of Entanglement Two Erich Gradel, Lukasz Kaiser, and Roman Rabinovich
- RAIRO-Theor. Inf. Appl. 42 (2008) 417450 Available online at: DOI: 10.1051/ita:2008008 www.rairo-ita.org
- Inductive Definability with Counting on Finite Structures
- A coarsification of the Wagner Hierarchy Equipe de Logique Math'emathique,
- Logical Definability of Counting Functions Kevin J. Compton
- Linear Time Datalog for Branching Time Logic \Lambda Georg Gottlob \Lambda Erich Gradel + Helmut Veith \Lambda;y
- Axiomatising treeinterpretable structures Achim Blumensath
- EpsilonLogic is More Expressive than FirstOrder Logic over Finite Structures
- DECIDABLE FRAGMENTS OF FIRST-ORDER AND FIXED-POINT LOGIC
- Generalized Quantifiers for Simple Properties Martin Otto
- Finite Model Theory and Descriptive Erich Gradel
- Stochastic Multiplayer Games Theory and Algorithms
- Regularity Problems for Visibly Pushdown Vince Barany1
- Asynchronous Omega-Regular Games with Partial Information
- An existential fragment of second order logic Eric Rosen \Lambda
- Some aspects of model theory and nite structures Department of Mathematics, Statistics and Computer Science
- Symmetry and FirstOrder: Explicitly PresentationInvariant Circuits
- Network Design with Selfish Agents GI Seminar Report, Dagstuhl 2004
- CARDINALITY AND COUNTING QUANTIFIERS ON OMEGA-AUTOMATIC STRUCTURES
- Generalising Automaticity to Modal Properties of Finite A. Dawar 1? and S. Kreutzer 2
- A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions \Lambda
- An Interpolation Theorem \Lambda Martin Otto
- Achim Blumensath Partition Width
- Why are modal logics so robustly decidable? Erich Gradel \Lambda
- In ationary Fixed Points in Modal Logic University of Cambridge Computer Laboratory
- Strategy Construction for Parity Games with Imperfect Information
- Operational Semantics for Fixed-Point Logics on Constraint Databases
- LogApproximable Minimization Problems on Random Inputs
- Internal Note #032 Computational Logic Inc.
- Beth Definability for the Guarded Fragment Eva Hoogland 1 , Maarten Marx 2 and Martin Otto 3
- Expressive Equivalence of Least and Inflationary FixedPoint Logic Stephan Kreutzer
- Department of Computer Science Technical Report
- On the restraining power of guards Erich Gradel \Lambda
- Game Logic is Strong Enough for Parity Games Dietmar Berwanger
- EXPRESSING CARDINALITY QUANTIFIERS IN MONADIC SECOND-ORDER LOGIC OVER CHAINS
- Automatic Veri cation of Abstract State Machines
- On Logics with Two Variables Erich Gradel \Lambda Martin Otto y
- The normal form of Borel sets Part I : Borel sets of finite rank
- Cardinality quantifiers in MLO over trees Vince Barany1
- DOI: 10.1007/s00224-004-1133-y Theory Comput. Systems OF1OF34 (2004)
- Complexity Measures for Directed Graphs Roman Rabinovich
- The Kolmogorov Expressive Power of Boolean Query Languages \Lambda
- Generalized Quantifiers and 01 Laws Anuj Dawar \Lambda Erich Gradel
- Logic and Approximation Von der MathematischNaturwissenschaftlichen Fakultat der
- Deciding the Veri cation Problem for Abstract State Machines
- Back and Forth Between Logic and Games Erich Gradel
- Fundamenta Informaticae XXI (2001) 10011017 1001 Expressing Cardinality Quantifiers in Monadic Second-Order Logic
- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
- Degrees of Lookahead in Regular Infinite Games Michael Holtmann1
- Parity Games with Partial Information Played on Graphs of Bounded Complexity1
- Synthesis for Structure Rewriting Systems Lukasz Kaiser
- The Descriptive Complexity of Parity Games Anuj Dawar1
- Automatic Presentations of Infinite Structures Vince Barany
- A Hierarchy of Automatic Words having a Decidable MSO Theory
- Pure and Applied Fixed-Point Logics
- Entanglement and the Complexity of Directed Graphs Dietmar Berwangera
- Distributed Synthesis for Regular and Contextfree Specifications
- A Perfect-Information Construction for Coordination in Games
- Graph Searching, Parity Games and Imperfect Information1
- Infinite Two-Player Games with Partial Information: Logic and Algorithms
- Definability and Model Checking
- The Field of Reals is not -Automatic Faried Abu Zaid1
- Dynamic Definability Erich Grdel
