Skip to main content
Log in

Complete Infinitary Type Logics

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

For each regular cardinal κ, we set up three systems of infinitary type logic, in which the length of the types and the length of the typed syntactical constructs are < κ. For a fixed κ, these three versions are, in the order of increasing strength: the local system Σ(κ), the global system gΣ(κ) (the difference concerns the conditions on eigenvariables) and the τ-system τΣ(κ) (which has anti-selection terms or Hilbertian τ-terms, and no conditions on eigenvariables). A full cut elimination theorem is proved for the local systems, and about the τ-systems we prove that they admit cut-free proofs for sequents in the τ-free language common to the local and global systems. These two results follow from semantic completeness proofs. Thus every sequent provable in a global system has a cut-free proof in the corresponding τ-systems. It is, however, an open question whether the global systems in themselves admit cut elimination.

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

Access this article

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. Degen, J. W., ‘Two formal vindications of logicism’, in: Philosophy of Mathematics, Proceed. 15th Intern. Wittgenstein Symp., ed. J. Czermak, Wien 1993, 243–250.

  2. Karp, C. R., Languages with Expressions of Infinite Length, North-Holland, Amsterdam 1964.

    Google Scholar 

  3. Maehara, S., and G. Takeuti, ‘A formal system of first-order predicate calculus with infinitely long expressions’, J. Math. Soc. Japan 13 (1961), 357–370.

    Google Scholar 

  4. Prawitz, D., ‘Hauptsatz for higher order logic’, J. Symp. Logic 33 (1968), 452–457.

    Google Scholar 

  5. Ramsey, F. P., Foundations. Essays in Philosophy, Logic, Mathematics and Economics, edited by D. H. Mellor, London 1978.

  6. SchÜtte, K., Proof Theory, Springer, New York-Heidelberg-Berlin 1977.

    Google Scholar 

  7. Takahashi, M., ‘A proof of the cut elimination theorem in simple type theory’, J. Math. Soc. Japan 19 (1967), 399–410.

    Google Scholar 

  8. Takeuti, G., Proof Theory (second edition), North-Holland, Amsterdam 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Degen, J.W. Complete Infinitary Type Logics. Studia Logica 63, 85–119 (1999). https://doi.org/10.1023/A:1005271521209

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005271521209

Navigation