, Structural cut elimination I. intuitionistic and classical logic, Information and Computation 157 (2000), no. 1/2, 84--141. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Tree-interpretable Structures - Blumensath (2001) (Correct)
....Proof. MSO(# ) model checking is decidable for T 2 and this property is conserved by MSO interpretations. All tree interpretable graphs are of finite clique width. On the other hand, their tree width can be unbounded as the example of the infinite clique K #0 shows. A result of Courcelle [11] which was extended to tree interpretable graphs by Barthelmann [2] shows that being of finite tree width imposes a strong restriction on the structure of a tree interpretable graph. Although stated only for graphs it also holds for arbitrary structures if one replaces G by its Gaifman graph in ....
....Barthelmann [2] shows that being of finite tree width imposes a strong restriction on the structure of a tree interpretable graph. Although stated only for graphs it also holds for arbitrary structures if one replaces G by its Gaifman graph in (2) 4) Proposition 6 (Barthelmann [2] Courcelle [11]) Let G be a tree interpretable graph. The following statements are equivalent: 1) G is HR equational. 2) G has finite tree width. 3) G does not contain the subgraph K n,n for some n 0 . 4) G is uniformly sparse. This characterisation allows us to extend Proposition 5 to GSO(# ....
, Structural properties of context-free sets of graphs generated by vertex replacement, Information and Computation, 116 (1995), pp. 275--293.
Axiomatising Tree-Interpretable Structures - Blumensath (2002) (1 citation) (Correct)
....tree interpretable Proposition 3. MSO(# ) model checking is decidable for every tree interpretable structure. All tree interpretable graphs are of finite clique width. On the other hand, their tree width can be unbounded as the example of the infinite clique K#0 shows. A result of Courcelle [11] which was extended to tree interpretable graphs by Barthelmann [2] shows that being of finite tree width imposes a strong restriction on the structure of a tree interpretable graph. Although stated only for graphs it also holds for arbitrary structures if one replaces G by its Gaifman graph in ....
....Barthelmann [2] shows that being of finite tree width imposes a strong restriction on the structure of a tree interpretable graph. Although stated only for graphs it also holds for arbitrary structures if one replaces G by its Gaifman graph in (2) 4) Proposition 4 (Barthelmann [2] Courcelle [11]) Let G be a tree interpretable graph. The following statements are equivalent: 1) G is HR equational. 3) K n,n is not a subgraph of G for some n (2) G has finite tree width. 4) G is uniformly sparse. This characterisation allows us to extend Proposition 3 to GSO(# Theorem 6. Let A ....
, Structural properties of context-free sets of graphs generated by vertex replacement, Information and Computation, 116 (1995), pp. 275--293.
Degree Problems for eNCE Graph Grammars - Skodinis, Wanke (Correct)
....less than k. There is a close relation between the bounded degree problem and the membership problem. It is well known that the membership problem of a confluent eNCE graph grammar G is in general NP hard and can be solved in polynomial time if the language of G is connected and of bounded degree [RW86, EL90, ER, Lau, Bra91, Cou]. The bounded degree problem for NLC graph grammars has been examined in [JRW86] It has been shown that the bounded degree problem is decidable for NLC graph grammars. The proof is obtained by a reduction to the finiteness problem for ETOL systems which has been shown to be PSPACE hard 1 ; see ....
B. Courcelle Structural properties of context-free sets of graphs generated by vertex replacement. Information and Computation, 116:275--293, 1995.
A judgmental analysis of linear logic - Bor-Yuh Evan Chang Self-citation (Logic) (Correct)
No context found.
, Structural cut elimination I. intuitionistic and classical logic, Information and Computation 157 (2000), no. 1/2, 84--141.
A Judgmental Analysis of Linear Logic - Bor-Yuh Evan Chang (2003) (1 citation) Self-citation (Logic) (Correct)
No context found.
, Structural cut elimination I. intuitionistic and classical logic, Information and Computation 157 (2000), no. 1/2, 84--141.
A Judgmental Analysis Of Linear Logic - Bor-Yuh Evan Chang (2003) (1 citation) Self-citation (Logic) (Correct)
No context found.
, Structural cut elimination I. intuitionistic and classical logic, Information and Computation, vol. 157 (2000), no. 1/2, pp. 84--141.
A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003) (1 citation) Self-citation (Logic) (Correct)
No context found.
, Structural cut elimination I. intuitionistic and classical logic, Information and Computation 157 (2000), no. 1/2, 84--141.
A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003) (1 citation) Self-citation (Logic) (Correct)
No context found.
, Structural cut elimination I. intuitionistic and classical logic, Information and Computation 157 (2000), no. 1/2, 84--141.
A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003) (1 citation) Self-citation (Logic) (Correct)
No context found.
, Structural cut elimination I. intuitionistic and classical logic, Information and Computation, vol. 157 (2000), no. 1/2, pp. 84--141.
Contributions to Parameterized Complexity - Mccartin (2003) (2 citations) (Correct)
No context found.
B. Courcelle: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, pp 12-75, 1990.
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