Independence results in computer science?
- 1 October 1981
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 23 (2) , 205-222
- https://doi.org/10.1016/0022-0000(81)90013-1
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Complexity classes of provable recursive functionsJournal of Computer and System Sciences, 1979
- Arithmetical hierarchy and complexity of computationTheoretical Computer Science, 1979
- On “provable” analogs of andTheory of Computing Systems, 1978
- Some independence results for Peano arithmeticThe Journal of Symbolic Logic, 1978
- On the Simplicity of Busy Beaver SetsMathematical Logic Quarterly, 1978
- Independence results in computer scienceACM SIGACT News, 1976
- Algebraic properties of number theoriesIsrael Journal of Mathematics, 1975
- The forcing companions of number theoriesIsrael Journal of Mathematics, 1973
- Theory of provable recursive functionsTransactions of the American Mathematical Society, 1965
- Retraceable SetsCanadian Journal of Mathematics, 1958