


default search action
Theoretical Computer Science, Volume 224
Volume 224, Numbers 1-2, August 1999
- Matthias Baaz:

Note on the Generalization of Calculations. 3-11 - Lev D. Beklemishev:

Parameter Free Induction and Provably Total Computable Functions. 13-33 - Bruno Courcelle:

The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs. 35-58 - Yuri Leonidovich Ershov:

On d-Spaces. 59-72 - Erich Grädel, Martin Otto:

On Logics with Two Variables. 73-113 - Philippe de Groote:

An Algebraic Correctness Criterion for Intuitionistic Multiplicative Proof-Nets. 115-134 - Bernhard Heinemann:

Temporal Aspects of the Modal Logic of Subset Spaces. 135-155 - Jean-Yves Marion:

From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices. 157-172 - Alexei Lisitsa, Vladimir Yu. Sazonov:

Linear Ordering on Graphs, Anti-Founded Sets and Polynomial Time Computability. 173-213 - Volker Diekert, Yuri V. Matiyasevich

, Anca Muscholl:
Solving Word Equations modulo Partial Commutations. 215-235 - Martin Otto:

Bisimulation-invariant PTIME and higher-dimensional µ-calculus. 237-265 - Guy Perrier:

A PSPACE-complete Fragment of Second-order Linear Logic. 267-289 - Gregory S. Tseytin:

A Formalization of Reasoning not Derived from Standard Predicate Logic. 291-317 - Andrei Voronkov:

Simultaneous Rigid E-unification and other Decision Problems Related to the Herbrand Theorem. 319-352

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














