Studia Logica

, Volume 35, Issue 4, pp 363–375 | Cite as

On the problem of deciding equality in partial combinatory algebras and in a formal system

  • Giuseppa Longo


Mathematical Logic Formal System Computational Linguistic Combinatory Algebra 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H. Barendregt,Some extensional term, models for combinatory logic and λ-calculi, Ph. D. Thesis, Utrecht, 1971.Google Scholar
  2. [2]
    H. Barendregt, Letter to the author, May 1975.Google Scholar
  3. [3]
    C. Böhm,Alcune proprietà delle forme βη-normali del λK-calcolo, Pubbl. IAC-CNR, Roma, 696 (1968).Google Scholar
  4. [4]
    A. Chauvin,Theory of objects and set theory, Ph. D. Thesis, Clermont Ferrand, 1974 (to appear inNotre Dame Journal of Formal Logic).Google Scholar
  5. [5]
    H. B. Curry andR. Feys,Combinatory logic, North Holland, Amsterdam, 1958.Google Scholar
  6. [6]
    H. B. Curry, J. R. Hindley andT. Seldin,Combinatory logic II, North Holland, Amsterdam, 1972.Google Scholar
  7. [7]
    H. Friedmann,Axiomatic recursive function theory,Logic Colloquim ‘69’ (Manchester, 1969) North Holland, Amsterdam, 1971, pp. 113–138.Google Scholar
  8. [8]
    J. R. Hindley andG. Mitschke,Some remarks about the, connections between combinatory logic and axiomatic recursion theory, Preprint, Darmstadt, 1975.Google Scholar
  9. [9]
    G. Kreisel,Some reasons for generalising recursion theory,Logic Colloqium ‘69’ (Manchester, 1969) North Holland, Amsterdam, 1971, pp. 139–198.Google Scholar
  10. [10]
    G. Longo andM. Venturini Zilli,A theory of computation with an identity discriminator, to appear inthe Proceedings of the Third, International Colloquium on Automata Languages and Programming, Academic Press, Edinburgh, 1976.Google Scholar
  11. [11]
    A. Robinson,Introduction to model theory and to the metamathematics of algebra, North Holland, Amsterdam, 1972.Google Scholar
  12. [12]
    D. Scott,A system of functional abstraction, Underground, Berkeley, 1963.Google Scholar
  13. [13]
    D. Scott,Some philosophical issues concerning theories of, combinators,Symposium on λ-Calculus and Computer Science (Rome 1975), Springer Verlag Lecture Notes 37, Berlin, 1975, pp. 346–366.Google Scholar
  14. [14]
    H. Strong,Construction of models for algebraically generalized recursive functions theory,Journal of Symbolic Logic 35 (1970), pp. 465–475.Google Scholar
  15. [15]
    M. Venturini Zilli,On different kinds of indefinite,Calcolo 11 (1974), pp. 67–77.Google Scholar
  16. [16]
    R. Wadsworth,Semantics and pragmatics of λ-calculus. Ph. D. Thesis, Oxford, 1971.Google Scholar
  17. [17]
    E. Wagner,Uniformely reflexive structures: on the nature of Gödelization and relative computability,Transactions of American Mathematical Society 144 (1969), pp. 1–41.Google Scholar

Copyright information

© Warszawa 1976

Authors and Affiliations

  • Giuseppa Longo
    • 1
    • 2
  1. 1.Istituto di Scienze dell' InformazioneUniversità di PisaItaly
  2. 2.Istituto MatematicoUniversità di GenovaItaly

Personalised recommendations