Skip to main content

Bertrand Russell, Herbrand’s theorem, and the assignment statement

  • Conference paper
  • First Online:
Artificial Intelligence and Symbolic Computation (AISC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1476))

Abstract

While propositional modal logic is a standard tool, first-order modal logic is not. Indeed, it is not generally understood that conventional first-order syntax is insufficiently expressible. In this paper we sketch a natural syntax and semantics for first-order modal logic, and show how it easily copes with well-known problems. And we provide formal tableau proof rules to go with the semantics, rules that are, at least in principle, automatable.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. C. Fitting. A modal Herbrand theorem. Fundamenta Informaticae, 28:101–122, 1996.

    MATH  MathSciNet  Google Scholar 

  2. M. C. Fitting and R. Mendelsohn. First-Order Modal Logic. Kluwer, 1998. Forthcoming.

    Google Scholar 

  3. G. Frege. Uber Sinn und Bedeutung. Zeitschrift fur Philosophie und philosophische Kritik, 100:25–50, 1892. “On Sense and Reference≓ translated in [4].

    Google Scholar 

  4. G. Frege. Translations from the Philosophical Writings of Gottlob Frege. Basil Blackwell, Oxford, 1952. P. Geach and M. Black editors.

    Google Scholar 

  5. J. W. Garson. Quantification in modal logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 249–307. D. Reidel, 1984.

    Google Scholar 

  6. D. Harel. Dynamic logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 497–604. D. Reidel, 1984.

    Google Scholar 

  7. B. Russell. On denoting. Mind, 14:479–493, 1905. Reprinted in Robert C. Marsh, ed., Logic and Knowledge: Essays 1901–1950, by Bertrand Russell, Allen & Unwin, London, 1956.

    Google Scholar 

  8. R. Stalnaker and R. Thomason. Abstraction in first-order modal logic. Theoria, 34:203–207, 1968.

    Article  MathSciNet  Google Scholar 

  9. R. Thomason and R. Stalnaker. Modality and reference. Nous, 2:359–372, 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Calmet Jan Plaza

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fitting, M. (1998). Bertrand Russell, Herbrand’s theorem, and the assignment statement. In: Calmet, J., Plaza, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 1998. Lecture Notes in Computer Science, vol 1476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055899

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64960-1

  • Online ISBN: 978-3-540-49816-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics