Computability-Theoretic Complexity of Countable Structures

Publisher: Cambridge University Press

E-ISSN: 1943-5894|8|4|457-477

ISSN: 1079-8986

Source: Bulletin of Symbolic Logic, Vol.8, Iss.4, 2002-12, pp. : 457-477

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