메뉴 건너뛰기
Archive for Mathematical Logic
Volumn 38, Issue 2, 1999, Pages 123-138
Lifting independence results in bounded arithmetic
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0038853495     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050118     Document Type: Article
Times cited : (13)
References (12)
  • 3
    • 0002880787 scopus 로고
    • Axiomatizations and conservation results for fragments of bounded arithmetic
    • Providence, American Mathematical Society
    • Buss, S. R. (1990) Axiomatizations and conservation results for fragments of bounded arithmetic, in: Logic and Computation, Contemporary Mathematics 106: 57-84. Providence, American Mathematical Society
    • (1990) Logic and Computation, Contemporary Mathematics , vol.106 , pp. 57-84
    • Buss, S.R.1
  • 4
    • 84962999048 scopus 로고
    • An application of boolean complexity to separation problems in bounded arithmetic
    • Buss, S. R., and Krajíček, J. (1994) An application of boolean complexity to separation problems in bounded arithmetic, Proceedings of the London Mathematical Society 69(3): 1-27
    • (1994) Proceedings of the London Mathematical Society , vol.69 , Issue.3 , pp. 1-27
    • Buss, S.R.1    Krajíček, J.2
  • 5
    • 0039717508 scopus 로고
    • Witnessing functions in bounded arithmetic and search problems
    • to appear
    • Chiari, M., and Krajíček, J. (1995) Witnessing functions in bounded arithmetic and search problems, Journal of Symbolic Logic, to appear
    • (1995) Journal of Symbolic Logic
    • Chiari, M.1    Krajíček, J.2
  • 6
    • 0000534645 scopus 로고
    • Some remarks on the theory of graphs
    • Erdós, P. (1947) Some remarks on the theory of graphs, Bulletin of the A.M.S. 53: 292-294
    • (1947) Bulletin of the A.M.S. , vol.53 , pp. 292-294
    • Erdós, P.1
  • 7
    • 0002343638 scopus 로고
    • Almost optimal lower bounds for small depth circuits
    • Randomness and Computation, ed. S.Micali, JAI Press
    • Hastad, J. (1989) Almost optimal lower bounds for small depth circuits. in: Randomness and Computation, ed. S.Micali, Ser.Adv.Comp.Res. 5: 143-170. JAI Press
    • (1989) Ser.Adv.Comp.Res. , vol.5 , pp. 143-170
    • Hastad, J.1
  • 8
    • 0009309925 scopus 로고
    • Fragments of bounded arithmetic and bounded query classes
    • Krajíček, J. (1993) Fragments of bounded arithmetic and bounded query classes, Transactions of the A.M.S. 338(2): 587-598
    • (1993) Transactions of the A.M.S. , vol.338 , Issue.2 , pp. 587-598
    • Krajíček, J.1
  • 9
    • 0003235615 scopus 로고
    • Bounded arithmetic, propositional logic, and complexity theory
    • Cambridge University Press, Cambridge - New York - Melbourne, 343 p.
    • Krajíček, J. (1995) Bounded arithmetic, propositional logic, and complexity theory, Encyclopedia of Mathematics and Its Applications, Vol. 60, Cambridge University Press, Cambridge - New York - Melbourne, 343 p.
    • (1995) Encyclopedia of Mathematics and Its Applications , vol.60
    • Krajíček, J.1
  • 12
    • 85030628807 scopus 로고
    • Ramsey's theorem in bounded arithmetic
    • Proc. Computer Science Logic, Eds. Boerger E. et. al.
    • Pudlák, P. (1992) Ramsey's theorem in bounded arithmetic, in :Proc. Computer Science Logic, Eds. Boerger E. et. al., Springer LN in Comp. Sci. 553: 308-312
    • (1992) Springer LN in Comp. Sci. , vol.553 , pp. 308-312
    • Pudlák, P.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.