Author： Kirousis Lefteris M.
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.37, Iss.6, 2004-12, pp. : 695-715
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The Complexity of Propositional Proofs
Bulletin of Symbolic Logic, Vol. 13, Iss. 4, 2007-12 ,pp. :
Access to resources
Recommend
The Complexity of Propositional Proofs
Bulletin of Symbolic Logic, Vol. 1, Iss. 4, 1995-12 ,pp. :
On the complexity of propositional quantification in intuitionistic logic
The Journal of Symbolic Logic, Vol. 62, Iss. 2, 1997-06 ,pp. :
Circumscription within monotonic inferences
The Journal of Symbolic Logic, Vol. 53, Iss. 3, 1988-09 ,pp. :