Skip to main content
SpringerLink
Log in

A proof-theoretical analysis of ptykes

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Summary

The notion of a “ptyx” is formalised in second-order arithmetic, and, using proof-theoretic techniques based on sequent-calculus, bounds are obtained for the ptykes of type 1 and 2 which can be proved to be ptykes using arithmetic comprehension.

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

Similar content being viewed by others

References

  1. Buchholz, W., Schütte, K.: Proof theory of impredicative subsystems of analysis. Napoli: Bibliopolis 1988

    Google Scholar 

  2. Girard, J.-Y.: 79-1 logic. Ann. Math. Logic21, 75–271 (1981)

    Google Scholar 

  3. Girard, J.-Y., Ressayre, J.P.: Elements de logiqueΠ n 1. Proc. Symp. Pure Math.42, 339–445 (1985)

    Google Scholar 

  4. Schwichtenberg, H.: Proof of theory: some applications of cut elimination. In: Barwise, J. (ed.) Handbook of Mathematical Logic. Amsterdam: North-Holland 1977

    Google Scholar 

  5. Takeuti, G.: Proof theory. Amsterdam: North-Holland 1975

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Silesia, Katowice, Poland

    J. R. G. Catlow

Authors
  1. J. R. G. Catlow
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Catlow, J.R.G. A proof-theoretical analysis of ptykes. Arch Math Logic 33, 57–79 (1994). https://doi.org/10.1007/BF01275470

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Mathematics subject classification (1991)

Search

Navigation