The following pages link to Erich Grädel (Q204638):
Displaying 50 items.
- Model-checking games for logics of imperfect information (Q391101) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- Finite model theory and its applications. (Q703863) (← links)
- Simple sentences that are hard to decide (Q810009) (← links)
- Backtracking games and inflationary fixed points (Q817842) (← links)
- Satisfiability of formulae with one \(\forall\) is decidable in exponential time (Q915716) (← links)
- Simple interpretations among complicated theories (Q923068) (← links)
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- 0-1 laws for recursive structures (Q1127833) (← links)
- Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
- Undecidability results on two-variable logics (Q1306795) (← links)
- Metafinite model theory (Q1383163) (← links)
- Finite presentations of infinite structures: Automata and interpretations (Q1764419) (← links)
- Fixed-point logics and solitaire games (Q1764420) (← links)
- Logical definability of counting functions (Q1816735) (← links)
- Guarded fixed point logics and the monadic theory of countable trees. (Q1853504) (← links)
- On the power of deterministic transitive closures (Q1893732) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Dependence and independence (Q1956372) (← links)
- Model checking games for the quantitative \(\mu \)-calculus (Q1959394) (← links)
- On logics with two variables (Q1960419) (← links)
- Separation logic and logics with team semantics (Q2172820) (← links)
- Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence (Q2172822) (← links)
- Provenance analysis: a perspective for description logics? (Q2185470) (← links)
- Provenance analysis for logic and games (Q2211257) (← links)
- Model-theoretic properties of \(\omega\)-automatic structures (Q2254518) (← links)
- The variable hierarchy of the \(\mu\)-calculus is strict (Q2643142) (← links)
- (Q2734948) (← links)
- (Q2767034) (← links)
- Definability of linear equation systems over groups and rings (Q2865066) (← links)
- (Q2904795) (← links)
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- Games and Model Checking for Guarded Logics (Q2996154) (← links)
- Banach-Mazur Games on Graphs (Q3165974) (← links)
- (Q3172381) (← links)
- (Q3172530) (← links)
- Directed Graphs of Entanglement Two (Q3183606) (← links)
- (Q3348901) (← links)
- ON THE NOTION OF LINEAR TIME COMPUTABILITY (Q3358229) (← links)
- (Q3408141) (← links)
- RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC! (Q4628673) (← links)
- Definability of linear equation systems over groups and rings (Q4649548) (← links)
- Banach-Mazur Games with Simple Winning Strategies. (Q4649554) (← links)
- (Q4910728) (← links)
- Undecidability results on two-variable logics (Q5048929) (← links)
- Dependency Concepts up to Equivalence. (Q5079749) (← links)
- (Q5091274) (← links)
