Skip to main content
SpringerLink
Log in

Predicate calculus and naive set theory in pure combinatory logic

  • Published:
Archiv für mathematische Logik und Grundlagenforschung 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. Goodman, N.D.: A simplification of combinatory logic. J. Symb. Logic37, 225–246 (1972).

    Google Scholar 

  2. Bunder, M.W.: Propositional and predicate calculuses based on combinatory logic. Notre Dame Journal of Formal LogicXV, 25–34 (1974).

    Google Scholar 

  3. Bunder, M.W.: A paradox in illative combinatory logic. Notre Dame Journal of Formal LogicXI, 467–470 (1970).

    Google Scholar 

  4. Bunder, M.W.: Various systems of set theory based on combinatory logic. Notre Dame Journal of Formal LogicXV, 192–206 (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Wollongong, P.O. Box 1144, 2500, Wollongong, N.S.W., Australia

    M. W. Bunder

Authors
  1. M. W. Bunder
    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

Bunder, M.W. Predicate calculus and naive set theory in pure combinatory logic. Arch math Logik 21, 169–177 (1981). https://doi.org/10.1007/BF02011642

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation