Skip to main content
SpringerLink
Log in

A logic of abstraction related to finite constructive number classes

  • Published:
Archive for Mathematical Logic 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. Aczel, P.: Frege structures and the notions of proposition, truth and set. In: Barwise, J., Keisler, H.J., Kunen, K. (eds.) The Kleene Symposium, pp. 31–59. Amsterdam: North-Holland 1980

    Google Scholar 

  2. Barendregt, H.: The Lambda Calculus: its syntax and semantics. Amsterdam: North-Holland 1984

    Google Scholar 

  3. Barwise, J.: Admissible sets and structures. Heidelberg: Springer 1975

    Google Scholar 

  4. Cantini, A.: A theory of formal truth arithmetically equivalent to ID1. J. Symb. Logic55, 244–259 (1990)

    Google Scholar 

  5. Cantini, A.: On a general theory of properties, which is based on type free iterated comprehension principles (in Italian). In: Ferro, R., Zanardo, A. (eds.) Atti degli incontri di Logica Matematica, vol. 3, pp. 53–57. Padova: Cluep 1987

    Google Scholar 

  6. Cantini, A.: Properties and operations, provisional version (revised English), translation of: Proprietà e operazioni. Napoli: Bibliopolis 1983

    Google Scholar 

  7. Feferman, S.: Towards useful type free theories I. J. Symb. Logic49, 75–111 (1984)

    Google Scholar 

  8. Feferman, S., Sieg, W.: Iterated inductive definitions and subsystems of analysis. In: Lect. Notes Math., vol. 897, pp. 16–77. Berlin Heidelberg New York: Springer 1981

    Google Scholar 

  9. Friedman, H., Sheard, M.: An axiomatic approach to self-referential truth. Ann. Pure Appl. Logic33, 1–21 (1987)

    Google Scholar 

  10. Gilmore, P.: Natural deduction based set theories: a new resolution of the old paradoxes. J. Symb. Logic51, 393–411 (1986)

    Google Scholar 

  11. Gödel, K.: Russell's mathematical logic. In: Schilpp, P.A. (ed.) The Philosophy of Bertrand Russell, pp. 125–153. Evanston: Northwestern University Press 1944

    Google Scholar 

  12. Hindley, R., Seldin, J.: Introduction to combinators and λ-calculus (London Math. Soc. Texts 1) Cambridge: Cambridge University Press 1986

    Google Scholar 

  13. Jäger, G.: Theories for admissible sets. Napoli: Bibliopolis 1986

    Google Scholar 

  14. Moschovakis, Y.N.: Elementary induction on abstract structures. Amsterdam: North-Holland 1974

    Google Scholar 

  15. Scott, D.: Combinators and classes. In: Böhm, C. (ed.) λ-Calculus and computer science. (Lect. Notes Comput. Sci., vol. 37, pp. 1–26. Berlin Heidelberg New York: Springer 1975

    Google Scholar 

  16. Simpson, S.G.: Subsystems of Z2 and reverse mathematics. In: Takeuti, G. (ed.) Proof theory, 2nd edn., pp. 432–446. Amsterdam: North-Holland 1987

    Google Scholar 

  17. Turner, R.: A theory of properties. J. Symp. Logic52, 455–471 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Filosofia, Università degli Studi, Via Bolognese 52, I-50139, Firenze, Italy

    Andrea Cantini

Authors
  1. Andrea Cantini
    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

Cantini, A. A logic of abstraction related to finite constructive number classes. Arch Math Logic 31, 69–83 (1991). https://doi.org/10.1007/BF01370695

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation