Model theoretic aspects of computational complexity
- 1 October 1978
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 23 (02725428) , 193-200
- https://doi.org/10.1109/sfcs.1978.23
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Rudimentary Predicates and Relative ComputationSIAM Journal on Computing, 1978
- Lower bounds for natural proof systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Existentially Closed Models of Basic Number TheoryPublished by Elsevier ,1977
- Independence results in computer scienceACM SIGACT News, 1976
- AlternationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- Hilbert’s tenth problem: Diophantine equations: positive aspects of a negative solutionPublished by American Mathematical Society (AMS) ,1976
- On Almost Everywhere Complex Recursive FunctionsJournal of the ACM, 1974
- A note on models and submodels of arithmeticPublished by Springer Nature ,1972
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- On the Computational Complexity of AlgorithmsTransactions of the American Mathematical Society, 1965