Skip to main content
SpringerLink
Log in

Reducibility of formulae of weak second order arithmetic to pseudo-canonical forms

Parts II, III

  • Published:
Studia Logica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A. Church,Applications of recursive arithmetic to the problem of circuit synthesis,Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, pp. 3–50.

  2. B. A. Trahténbrot,Synthesis of logical nets which have operators described by means of one-argument predicates (in Russian),Doklady Akadémii Nauk SSSR, vol. 118, No. 4 (1958), pp. 646–649.

    Google Scholar 

  3. B. A. Trahténbrot,Some constructions in logic of one-argument predicates (in Russian),Doklady Akadémii Nauk SSSR, vol. 138, No. 2 (1961), pp. 320–321.

    Google Scholar 

  4. B. A. Trahténbrot,Finite automata and logic of one-argument predicates (in Russian),Doklady Akadémii Nauk SSSR, vol. 140, No. 2 (1961), pp 326–329.

    Google Scholar 

  5. B. A. Trahténbrot Finite automata and logic of one argument predicates (in Russian),Sibirskij Matématičéskij Žurnal, vol. 3, No. 1 (1962), pp. 103–131.

    Google Scholar 

  6. N. É. Kobrinskij andB. A. Trahténbrot,Introduction into the theory of finite automata (in Russian), Moscow, 1962.

  7. J. R. Büchi,Weak-second order arithmetic and finite automata,Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 6, No. 1 (1960), pp. 66–92.

    Google Scholar 

  8. R. Kołodziej,On a certain subclass of formulae of recursive arithmetic (in Polish),Zeszyty Matematyczne, Politechnika Wrocławska, 1973.

  9. B. A. Trahténbrot andJ. M. Berzdin,Finite automata-behaviour and synthesis (in Russian), Moscow, 1970.

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Theoretical Physics, Technical University, Wrocław

    Reinhold Kołodziej

Authors
  1. Reinhold Kołodziej
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Allatum est die 6 Martii 1973

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kołodziej, R. Reducibility of formulae of weak second order arithmetic to pseudo-canonical forms. Stud Logica 33, 233–258 (1974). https://doi.org/10.1007/BF02123279

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02123279

Keywords

Search

Navigation