Some generalizations to two systems of set theory based on combinatory logic

  • M. W. Bunder
Article
Received:
  • 22 Downloads

Keywords

Mathematical Logic Combinatory Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bunder, M.W.: A one axiom set theory based on higher order predicate calculus. Archiv. für Math. Logik und Grundlagenforschung Vol. 23 (1983) pp. 99–107.Google Scholar
  2. [2]
    Bunder, M.W.: Set theory in predicate calculus with equality. Archiv für Math. Logik und Grundlagenforschung Vol. 23 (1983) pp. 109–113.Google Scholar
  3. [3]
    Bunder, M.W.: A weak absolute consistency proof for some systems of illative combinatory logic. Journal of Symbolic Logic, Vol. 48 (1983) pp. 771–776.Google Scholar
  4. [4]
    Bunder, M.W.: Overlapping types in higher order predicate calculus based on combinatory logic. Journal of Nonclassical Logic, to appear.Google Scholar
  5. [5]
    Bunder, M.W.: Some consistency proofs and a characterization of inconsistency proof in illative combinatory logic. Journal of symbolic logic, to appearGoogle Scholar

Copyright information

© Verlag W. Kohlhammer 1987

Authors and Affiliations

  • M. W. Bunder
    • 1
  1. 1.Dept. of MathematicsThe University of WollongongWollongong N.S.W.Australia

Personalised recommendations