Journals in DBLP

Theor. Comput. Sci.
1992, volume: 103, number: 2

1. Michel Bauderon
   Infinite Hypergraphs II: Systems of Recursive Equations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:103, n:2, pp:165-190 [Journal]
   
2. Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima
   Infinity-Regular Temporal Logic and its Model Checking Problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:103, n:2, pp:191-204 [Journal]
   
3. Luigi Palopoli
   Testing Logic Programs for Local Stratification. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:103, n:2, pp:205-234 [Journal]
   
4. Matthias Felleisen, Robert Hieb
   The Revised Report on the Syntactic Theories of Sequential Control and State. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:103, n:2, pp:235-271 [Journal]
   
5. Masahito Kurihara, Azuma Ohuchi
   Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:103, n:2, pp:273-282 [Journal]
   
6. Byeong Man Kim, Jung Wan Cho
   A New Subsumption Method in the Connection Graph Proof Procedure. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:103, n:2, pp:283-309 [Journal]
   
7. Carl A. Gunter
   The Mixed Powerdomain. [Citation Graph (2, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:103, n:2, pp:311-334 [Journal]
   
8. Andrea Maggiolo-Schettini, Józef Winkowski
   Towards an Algebra for Timed Behaviours. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:103, n:2, pp:335-363 [Journal]
   
9. V. Wiktor Marek, V. S. Subrahmanian
   The Relationship Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:103, n:2, pp:365-386 [Journal]
   
10. Harry G. Mairson
    A Simple Proof of a Theorem of Statman. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:103, n:2, pp:387-394 [Journal]
    
11. Thomas Streicher
    Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:103, n:2, pp:395-408 [Journal]
    
12. Max Dauchet
    Simulation of Turing Machines by a Regular Rewrite Rule. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:103, n:2, pp:409-420 [Journal]