Publisher： Springer Publishing Company
ISSN： 0168-7433
Source： Journal of Automated Reasoning, Vol.37, Iss.1-2, 2006-08, pp. : 3-20
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
Tractability of cut-free Gentzen type propositional calculus with permutation inference
By Arai N.H.
Theoretical Computer Science, Vol. 170, Iss. 1, 1996-12 ,pp. :
Access to resources
Recommend
On boolean lowness and boolean highness
Theoretical Computer Science, Vol. 261, Iss. 2, 2001-06 ,pp. :
Process algebra with propositional signals
By Baeten J.C.M. Bergstra J.A.
Theoretical Computer Science, Vol. 177, Iss. 2, 1997-05 ,pp. :
On compact representations of propositional circumscription
By Cadoli M. Donini F.M. Schaerf M. Silvestri R.
Theoretical Computer Science, Vol. 182, Iss. 1, 1997-08 ,pp. :
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
By Esik Z.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :