| S. Hirokawa. The number of proofs for an implicational formula (abstract) . In Journal of Symbolic Logic 58:1117, 1993. |
.... See [Aka91] By combining preceding theorems with known results in theory of languages, we can easily obtain algorithms to solve the emptyness finiteness problems of the sets L t (0; A) B t (0; A) L(0; A) and B(0;A) Thus we get a short proof of the result by [BY79] See also [Hin] [Hir92]. Corollary 3.8 One can decide whether L t (0; A) is empty, finite, or infinite for any 0 and A. The same holds true for B t (0; A) L(0; A) and B(0; A) Proof) It is well known (e.g. HU79] that if G is a context free grammar with k non terminal symbols, then ffl L(G) is empty if and ....
S. Hirokawa. The number of proofs for implicational formulas (abstract). In Proceedings of Logic Colloquium '92, volume 36. Janos Bolyai Mathematical Society, 1992.
....theorem 3.5. 2 By combining preceding theorems with well known results in theory of languages, one can easily obtain algorithms to solve the emptyness finiteness problems of the sets L t (0; A) B t (0; A) L(0; A) and B(0; A) Thus we get a short proof of the result by [BY79] See also [Hin] [Hir93]. Corollary 3.8 One can decide whether L t (0; A) is empty, finite, or infinite for any 0 and A. The same holds true for B t (0; A) L(0; A) and B(0; A) Proof It is well known (e.g. HU79] that if G is a context free grammar with k non terminal symbols, then ffl L(G) is empty if and only ....
S. Hirokawa. The number of proofs for an implicational formula (abstract) . In Journal of Symbolic Logic 58:1117, 1993.
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