## The Boundary between Decidability and Undecidability for Transitive-Closure Logics (2004)

### Cached

### Download Links

- [www.cs.tau.ac.il]
- [www.math.tau.ac.il]
- [www.cs.umass.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Computer Science Logic (CSL |

Citations: | 32 - 5 self |

### BibTeX

@INPROCEEDINGS{Immerman04theboundary,

author = {N. Immerman and A. Rabinovich and T. Reps and M. Sagiv and G. Yorsh},

title = {The Boundary between Decidability and Undecidability for Transitive-Closure Logics},

booktitle = {In Computer Science Logic (CSL},

year = {2004},

pages = {160--174}

}

### Years of Citing Articles

### OpenURL

### Abstract

To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from a program's variables. On the other hand, with a few notable exceptions, adding transitive closure to even very tame logics makes them undecidable. In this paper, we explore...

### Citations

2392 | Computational Complexity
- Papadimitriou
- 1994
(Show Context)
Citation Context ... be a tiling problem as in Definition 1, and let n be a natural number. It is an NEXPTIME-complete problem to test on input (T , 1 n ) whether there is a T -tiling of a square grid of size 2 n by 2 n =-=[12].-=- We will define a formula ϕn that expresses exactly a solution to this tiling problem. There will be two constants: s, denoting the cell in the upper-left corner, and t, denoting the cell in the lowe... |

564 | Parametric Shape Analysis via 3-Valued Logic
- Sagiv, Reps, et al.
(Show Context)
Citation Context ...suing. Very generally, we model the properties of an infinite set of data structures that can be generated by the program we are analyzing, using a bounded set of first-order, three-valued structures =-=[14]-=-. In [15], it is shown that this modeling can be improved so that it computes the most precise possible transformation summarizing each program step, through the use of decidable logics. Furthermore, ... |

289 |
Decidability of second-order theories and automata on infinite trees
- Rabin
- 1969
(Show Context)
Citation Context ...eptions, adding transitive closure to even very tame logics makes them undecidable. In this paper, we explore the boundary between decidability and undecidability for transitive-closure logics. Rabin =-=[13]-=- proved that the monadic second-order theory of trees is decidable, although the complexity of the decision procedure is not elementary. If we go beyond trees, however, undecidability comes immediatel... |

279 |
Descriptive Complexity
- Immerman
- 1999
(Show Context)
Citation Context ...pplications. However, adding a transitive-closure operator tends to make even very tame logics undecidable. We use TCu,u ′[ϕ] to denote the reflexive, transitive closure of binary relation ϕ(u, u =-=′ ) [8]. -=-Note: In this paper, we confine our attention to applications of TC[ϕ] for 2swhich ϕ is quantifier-free and TC-free. Furthermore, we assume throughout that the arity of all relation symbols is bound... |

274 |
The Classical Decision Problem
- Börger, Grädel, et al.
- 1997
(Show Context)
Citation Context ...e relevant theorem. Decidable Complexity Citation µ calculus EXPTIME complete [3] Guarded Fixed Point EXPTIME complete [6] MSO(trees) non-elementary [13] FO 2 NEXPTIME complete [11, 4] ∃∀(TC comp=-=lete [1] − ) Σ p ∃∀(DTC 2-=- complete Prop 2 + [E]) NEXPTIME complete Th 4, 5 ∃∀(TC, f) NEXPTIME complete Cor 6 ∃∀ Σ p 2 Undecidable Citation FO 2 (TC) [5] FO 2 (DTC) [5] ∀(TC + [E]) Cor 9 ∀(DTC + ) Th 8 ∀(DTC −... |

151 |
The complexity of tree automata and logics of programs
- Emerson, Jutla
- 1999
(Show Context)
Citation Context ... go beyond trees, however, undecidability comes immediately. Modal logics and their extension to the µ calculus have proved quite useful. The µ calculus has an EXPTIME-complete satisfiability proble=-=m [3]-=- and the same has been shown true even for the more expressive guarded fixed-point logic, as long as the vocabulary remains of bounded arity [6]. Guarded fixed-point logic can express reachability fro... |

125 | Mona: Monadic second-order logic in practice
- Henriksen, Jensen, et al.
- 1996
(Show Context)
Citation Context ...ability problems for monadic second-order logic with a single unary function symbol are decidable, 8 although their complexities are not elementary, even when restricted to first-order quantification =-=[10, 13, 1, 7]. -=-It is not hard to modify the proofs of Theorems 4 and 5 to apply to ∀(TC, f). (For functions, the implication of Equation (1) is a biimplication, and thus the result goes through for positive and ne... |

62 | Guarded Fixed Point Logic
- Grädel, Walukiewicz
- 1999
(Show Context)
Citation Context ...calculus has an EXPTIME-complete satisfiability problem [3] and the same has been shown true even for the more expressive guarded fixed-point logic, as long as the vocabulary remains of bounded arity =-=[6]-=-. Guarded fixed-point logic can express reachability from a specific constant, or from some point of a specific color, and it can restrict this reachability to be along paths specified, for example, b... |

52 | Symbolically computing most-precise abstract operations for shape analysis
- Yorsh, Reps, et al.
- 2004
(Show Context)
Citation Context ...ry generally, we model the properties of an infinite set of data structures that can be generated by the program we are analyzing, using a bounded set of first-order, three-valued structures [14]. In =-=[15]-=-, it is shown that this modeling can be improved so that it computes the most precise possible transformation summarizing each program step, through the use of decidable logics. Furthermore, in [9] we... |

33 |
Weak monadic second-order theory of successor is not elementary recursive
- Meyer
- 1975
(Show Context)
Citation Context ...ability problems for monadic second-order logic with a single unary function symbol are decidable, 8 although their complexities are not elementary, even when restricted to first-order quantification =-=[10, 13, 1, 7]. -=-It is not hard to modify the proofs of Theorems 4 and 5 to apply to ∀(TC, f). (For functions, the implication of Equation (1) is a biimplication, and thus the result goes through for positive and ne... |

29 | E.Rosen. Undecidability results on two-variable logics
- Grädel, Otto
- 1999
(Show Context)
Citation Context ...tary [13] FO 2 NEXPTIME complete [11, 4] ∃∀(TC complete [1] − ) Σ p ∃∀(DTC 2 complete Prop 2 + [E]) NEXPTIME complete Th 4, 5 ∃∀(TC, f) NEXPTIME complete Cor 6 ∃∀ Σ p 2 Undecidable=-= Citation FO 2 (TC) [5] FO 2 (D-=-TC) [5] ∀(TC + [E]) Cor 9 ∀(DTC + ) Th 8 ∀(DTC − [E]) Th 13 Fig. 1. Summary of the decidability and complexity, and the undecidability of the logics we study. The arity of all relation symbols... |

23 |
On the decision problem for two-variable first-order logic
- Kolaitis, Vardi
- 1997
(Show Context)
Citation Context ...nclude the number of the relevant theorem. Decidable Complexity Citation µ calculus EXPTIME complete [3] Guarded Fixed Point EXPTIME complete [6] MSO(trees) non-elementary [13] FO 2 NEXPTIME complete=-= [11, 4] ∃∀(TC complete [1] -=-− ) Σ p ∃∀(DTC 2 complete Prop 2 + [E]) NEXPTIME complete Th 4, 5 ∃∀(TC, f) NEXPTIME complete Cor 6 ∃∀ Σ p 2 Undecidable Citation FO 2 (TC) [5] FO 2 (DTC) [5] ∀(TC + [E]) Cor 9 ∀(D... |

23 | Verification via Structure Simulation
- Immerman, Rabinovich, et al.
- 2004
(Show Context)
Citation Context ...n [15], it is shown that this modeling can be improved so that it computes the most precise possible transformation summarizing each program step, through the use of decidable logics. Furthermore, in =-=[9] we -=-show that we can use a method we call “structure simulation” to significantly extend the sets of data structures that we can model with decidable logics over trees (monadic second-order logic) or ... |

17 |
Space-Bounded FOIES
- Dong, Su
- 1995
(Show Context)
Citation Context ...]) compared with MSO(trees) is that while the latter is usually much more expressive, we can go beyond trees in the former. As an example, to express reachability in dynamic, undirected graphs, as in =-=[2]-=-, we need not only a spanning forest, but a record of all the remaining edges in the undirected graph [9]. Fig. 1 summarizes results concerning the decidability and complexity of satisfiability for re... |

11 |
On languages with two variables. Zeitschr. f. math. Logik u. Grundlagen d
- Mortimer
- 1975
(Show Context)
Citation Context ...nclude the number of the relevant theorem. Decidable Complexity Citation µ calculus EXPTIME complete [3] Guarded Fixed Point EXPTIME complete [6] MSO(trees) non-elementary [13] FO 2 NEXPTIME complete=-= [11, 4] ∃∀(TC complete [1] -=-− ) Σ p ∃∀(DTC 2 complete Prop 2 + [E]) NEXPTIME complete Th 4, 5 ∃∀(TC, f) NEXPTIME complete Cor 6 ∃∀ Σ p 2 Undecidable Citation FO 2 (TC) [5] FO 2 (DTC) [5] ∀(TC + [E]) Cor 9 ∀(D... |