Skip to main content
SpringerLink
Log in

Combinatory completeness without classical equality

  • Published:
Journal of Philosophical 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. G. Boolos, The Unprovability of Consistency, Cambridge University Press, Cambridge, 1979.

    Google Scholar 

  2. C. Bernardi and A. Sorbi, ‘Classifying positive equivalence relations’, The Journal of Symbolic Logic, Vol. 48 (1983), pp. 529–538.

    Google Scholar 

  3. C. Bernardi and F. Montagna, ‘Equivalence relations induced by extensional formulae: Classification by means of a new fixed point property’, Fundamental Mathematicae, Vol. 124, (1984), pp. 221–233.

    Google Scholar 

  4. P. Lindström, ‘Some results of interpretability’, Proceedings of the 5th Scandinavian Logic Symposium, Aalborg 1979, pp. 329–361.

  5. F. Montagna, ‘Relatively precomplete numerations and arithmetic’, Journal of Philosophical Logic, Vol. 11 (1982), pp. 419–430.

    Google Scholar 

  6. H. Rogers Jr., Theory of Recursive Functions and Effective Compatibility, Hill, New York, 1967.

    Google Scholar 

  7. R. M. Smullyan, Theory of Formal Systems, Princeton University Press, Princeton, 1961.

    Google Scholar 

  8. A. Visser, ‘Numerations, λ-calculus & arithmetic’, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (I. E. Hindley and J. P. Seldin, eds.), Academic Press, New York and London, 1980, pp. 259–284.

    Google Scholar 

  9. A. Visser, ‘The provability logics of recursively ennumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic’, Journal of Philosophical Logic, Vol. 13 (1984), pp. 97–113.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Sonoma State University, 94928, Rohnert Park, CA, U.S.A.

    David Ballard

Authors
  1. David Ballard
    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

Ballard, D. Combinatory completeness without classical equality. J Philos Logic 17, 115–132 (1988). https://doi.org/10.1007/BF00247907

Download citation

  • Issue Date:

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

Search

Navigation