Skip to main content
SpringerLink
Log in

Logic programming of some mathematical paradoxes

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 380))

Included in the following conference series:

  • 149 Accesses

Abstract

Using the notions of logic field and ion defined in [7, 9], we give an algorithmic analysis, in terms of logic programming, of three paradoxes: Protagoras, Newcomb and the Hangman. We show that each one of these paradoxes points out a programming mistake to be avoided in logic programming.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. A. Ashcroft, W. W. Wadge. Prescription for semantics, ACM TOPLAS 4 (2), (1982) pp. 238–293

    Article  Google Scholar 

  2. N. Asher, J. Kamp. The knower's paradox and representational theories of attitudes, in Theoretical Aspects of Reasoning about Knowledge, J. Y. Halpern ed, Morgan Kaufmann (1986), pp. 131–147

    Google Scholar 

  3. H. Barendregt. The type free lambda calculus, in Handbook of Mathematical Logic, J. Barwise ed, North Holland (1977), pp. 1091–1142.

    Google Scholar 

  4. van Emden M.H. and Kowalski R. The semantics of logic as a programming language, J. ACM 23, (1976) pp. 733–742

    Article  Google Scholar 

  5. Guessarian I. Algebraic semantics, Springer LNCS 99, Berlin (1981)

    Google Scholar 

  6. D. Kaplan, R. Montague. A paradox regained, Notre Dame Journal of Formal Logic 1, (1960), pp. 79–90

    Google Scholar 

  7. Nait Abdallah M. A. Ions and local definitions in logic programming, Springer LNCS 210 (1986), pp. 60–72

    Google Scholar 

  8. Nait Abdallah M. A. Procedures in logic programming, Springer LNCS 225 (1986), pp. 433–447

    Google Scholar 

  9. Nait Abdallah M. A. AL-KHOWARIZMI: A formal system for higher order logic programming, Springer LNCS 233 (1986), pp. 545–553

    Google Scholar 

  10. Nait Abdallah M.A. Logic programming with ions, Springer LNCS 267 (1987), pp. 11–20

    Google Scholar 

  11. Nait Abdallah M.A. Heuristic logic and the process of discovery, Proc. Fifth International Conference of Logic Programmaing, Bowen and Kowalski ed., Vol 2. MIT Press (1988)

    Google Scholar 

  12. Nait Abdallah M.A. A logico-algebraic approach to the model theory of knowledge, (Theoretical Computer Science, to appear)

    Google Scholar 

  13. R. Nozick. Newcomb's problem and two principles of choice, in Essays in Honor of Carl G. Hempel, N. Rescher ed., Humanities Press (1969)

    Google Scholar 

  14. W.V.O. Quine, On a so-called paradox, Mind 57, (1953), pp. 65–67

    Google Scholar 

  15. J. Stoy, The Scott-Strachey approach to programming language semantics, MIT Press (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, London, Ontario, Canada

    M. A. Nait Abdallah

Authors
  1. M. A. Nait Abdallah
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nait Abdallah, M.A. (1989). Logic programming of some mathematical paradoxes. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation