Author： Meister Daniel
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.41, Iss.2, 2007-08, pp. : 257-289
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
Complexity of Equations over Sets of Natural Numbers
By Jeż Artur
Theory of Computing Systems, Vol. 48, Iss. 2, 2011-02 ,pp. :
Access to resources
Recommend
Existence of some sparse sets of nonstandard natural numbers
The Journal of Symbolic Logic, Vol. 66, Iss. 2, 2001-06 ,pp. :
Decidable regularly closed fields of algebraic numbers
The Journal of Symbolic Logic, Vol. 50, Iss. 2, 1985-06 ,pp. :
Decidable properties of finite sets of equations in trivial languages
The Journal of Symbolic Logic, Vol. 49, Iss. 4, 1984-12 ,pp. :