On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines

Publisher: Cambridge University Press

E-ISSN: 1943-5886|53|4|1098-1109

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.53, Iss.4, 1988-12, pp. : 1098-1109

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