Funder
Grantová Agentura, Univerzita Karlova
Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. Ajtai, M.: Generalizations of the compactness theorem and Gödel’s completeness theorem for nonstandard finite structures. In: Proceedings of the 4th International Conference on Theory and Applications of Models of Computation, pp. 13–33 (2007)
2. Ajtai, M.: A Generalization of Gödel’s Completeness Theorem for Nonstandard Finite Structures, manuscript (2011)
3. Allen, B.: Arithmetizing uniform NC. Ann. Pure Appl. Log. 53, 1–50 (1991)
4. Buss, S.: Bounded Arithmetic, Bibliopolis (1986)
5. Buss, S.: Weak End Extensions of Models of Bounded Arithmetic, unpublished manuscript (1986)
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polynomial time ultrapowers and the consistency of circuit lower bounds;Archive for Mathematical Logic;2019-06-04
2. Bibliography;Proof Complexity;2019-03-28
3. The Nature of Proof Complexity;Proof Complexity;2019-03-28
4. Model Theory and Lower Bounds;Proof Complexity;2019-03-28
5. Hard Tautologies;Proof Complexity;2019-03-28