A PSPACE-complete fragment of second-order linear logic

Author： Perrier G.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.224, Iss.1, 1999-08, pp. : 267-289

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The monadic second-order logic of graphs X: Linear orderings

By Courcelle B.  

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 87-143

Elsevier

Access to resources Recommend Favorite

PSPACE-complete problems for subgroups of free groups and inverse finite automata

By Birget J.-C.   Margolis S.   Meakin J.   Weil P.  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 247-281

Elsevier

Access to resources Recommend Favorite

Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete

By Slany W.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 829-843

Elsevier

Access to resources Recommend Favorite

Monadic second-order logic on tree-like structures

By Walukiewicz I.  

Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. : 311-346

Elsevier

Access to resources Recommend Favorite

On dynamic reconstruction of input in the second-order linear systems

By Blizorukova M.  

Automation and Remote Control, Vol. 71, Iss. 5, 2010-05 ,pp. : 816-825

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite