Archive for Mathematical Logic

, Volume 29, Issue 3, pp 149–169 | Cite as

S 3 i andV 2 i (BD)

  • Gaisi Takeuti
Article
Received:
Revised:

Keywords

Mathematical Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Buss, S.: Bounded arithmetic. Napoli: Bibliopolis 1986Google Scholar
  2. 2.
    Buss, S.: Axiomatizations and conservation results for fragments of bounded arithmetic. (To appear in: Contemporary Mathematics AMS, Proc. of Workshop in Logic and Computation, 1987)Google Scholar
  3. 3.
    Nelson, E.: Predicative arithmetic. Princeton University Press, 1986Google Scholar
  4. 4.
    Wilkie, A., Paris, J.: On the scheme of induction for bounded arithmetic formulas. Ann. Pure Appl. Logic35, 267–302 (1987)Google Scholar
  5. 5.
    Takeuti, G.: Bounded arithmetic and truth definition. Ann. Pure Appl. Logic39, 75–104 (1988)Google Scholar
  6. 6.
    Takeuti, G.: Some relations among systems for bounded arithmetic. (To appear in: Petkov, P. (ed), Heyting: Mathematical logic. London, Plenum Press)Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Gaisi Takeuti
    • 1
  1. 1.Department of MathematicsUniversity of IllinoisUrbanaUSA

Personalised recommendations