Skip to main content

Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions

  • Conference paper

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

Abstract

The logic of partial terms (LPT) is a variety of negative free logic. In LPT, functions, as well as predicates, are strict, and free variables are given the generality interpretation. Both nonconstructive (classical) and intuitionist brands of negative free logic have served in foundational investigations, and Hilbert-style axiomatizations, natural deduction systems, and Gentzen-style sequents have been developed for them. This paper focuses on nonconstructive LPT with definite descriptions, called LPD, lays the foundation for tableaux systems by defining the concept of an LPD model system and establishing Hintikka’s Lemma, and summarizes the corresponding tableaux proof rules.

Karel Lambert helped me understand better the nature and scope of free logics. All of my previous work had been with positive free logics, and he introduced me to negative free logics. I am grateful to him for a number of useful suggestions.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beeson, M.: Foundations of Constructive Mathematics. Springer, Berlin (1985)

    MATH  Google Scholar 

  2. Bencievenga, E., Lambert, K., van Fraassen, B.: Logic, Bivalence, and Denotation, 2nd edn., Ridgeview, Atascadero, California (1991)

    Google Scholar 

  3. Boolos, G.S., Jeffrey, R.C.: Computability and Logic. Cambridge University Press, Cambridge (1974)

    MATH  Google Scholar 

  4. Burge, T.: Truth and singular terms. In: [18] (1991)

    Google Scholar 

  5. Farmer, W.M.: Reasoning about partial functions with the aid of a computer. Erkenntnis 43, 279–294 (1995)

    Article  MathSciNet  Google Scholar 

  6. Feferman, S.: Definedness. Erkenntnis 43, 295–320 (1995)

    Article  MathSciNet  Google Scholar 

  7. Feijs, L.M.G., Jonkers, H.B.M.: Formal Specification and Design. Cambridge University Press, Cambridge (1992)

    Book  MATH  Google Scholar 

  8. Fitting, M.: First-Order Logic and Automated Theorem Proving, 2nd edn. Springer,New York (1996)

    MATH  Google Scholar 

  9. Fourman, M.P., Mulvey, C.J., Scott, D.S. (eds.): Applications of sheaves: Proceedings of the Research Symposium on Applications of Sheaf Theory to Logic, Algebra, and Analysis, Durham. Lecture Notes in Mathematics, vol. 753. Springer, Berlin (1979)

    MATH  Google Scholar 

  10. ESPRIT CoFI Working Group. Cofi: The Common Framework Initiative for algebraic specification and development (various documents), Available at http://www.briks.dk/Projects/CoFI

  11. Gumb, R.D.: Evolving Theories. Haven, New York (1979)

    Google Scholar 

  12. Gumb, R.D.: An extended joint consistency theorem for free logic with equality. Notre Dame Journal of Formal Logic 20, 321–335 (1979); Abstract in Journal of Symbolic Logic 42, 146 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gumb, R.D.: An extended joint consistency theorem for a family of free modal logics with equality. Journal of Symbolic Logic 49, 174–183 (1984); Abstract in Journal of Symbolic Logic  46, 435–436 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gumb, R.D.: Programming Logics: An Introduction to Verification and Semantics. Wiley, New York (1989)

    Google Scholar 

  15. Gumb, R.D.: Free logic in program specification and verification. In: Morsher, E. (ed.) New Directions in Free Logic. Akademia Verlag, Bonn (1996)

    Google Scholar 

  16. Gumb, R.D., Lambert, K.: Definitions in nonstrict positive free logic. Modern Logic, 7:25{55 (1997), Corrected version, available at http://www.cs.uml.edu/~gumb

  17. Hoare, C.A.R.: An axiomatic basis of computer programming. Communications of the ACM 12, 576–583 (1969)

    Article  MATH  Google Scholar 

  18. Lambert, K. (ed.): Philosophical Applications of Free Logic. Oxford University Press, Oxford (1991)

    Google Scholar 

  19. Lambert, K.: On the philosophical foundations of free description theory. History and Philosophy of Logic 8, 57–66 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  20. Leblanc, H.: Truth-Value Semantic. North Holland, Amsterdam (1976)

    Google Scholar 

  21. Parnas, D.L.: A logic for describing, not verifying, software. Erkenntnis 43, 321–338 (1995)

    Article  MathSciNet  Google Scholar 

  22. Pljuškevičus, R.A.: A sequential variant of constructive logic calculi for normal formulas not containing structural rules. In: The Calculi of Symbolic Logic, I, Proceedings of the Steklov Institute for Mathematics Vol. 98, pp. 175–229. AMS Translations, Dordrecht (1971)

    Google Scholar 

  23. Plotkin, G.D.: Denotational semantics with partial functions. Lecture Notes, CSLI Summer School, Stanford University (July 1985)

    Google Scholar 

  24. Plotkin, G.D.: Types and partial functions. Lecture Notes, Computer Science Department, University of Edinburgh (1985)

    Google Scholar 

  25. Scales, R.: Attribution and Existence. PhD thesis, University of California, Irvine (1969)

    Google Scholar 

  26. Schock, R.: Contributions to syntax, semantics, and the philosophy of science. Notre Dame Journal of Formal Logic 5, 241–289 (1964)

    Article  MathSciNet  Google Scholar 

  27. Schock, R.: On definitions. Archiv für Mathematische Logik und Grundlagenforschung 8, 28–44 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  28. Schock, R.: Logics without Existence Assumptions. Almqvist and Wiksell, Stockholm (1968)

    MATH  Google Scholar 

  29. Scott, D.S.: Existence and description in formal logic. In: Schoenmann, R. (ed.) Bertrand Russell, Philosopher of the Century, Allen and Unwin, London, pp. 181–200 (1967); Reprinted in [18]

    Google Scholar 

  30. Scott, D.S.: Identity and existence in intuitionistic logic. In: [9], pp. 660–696 (1979)

    Google Scholar 

  31. Tennant, N.: Natural Logic. Edinburgh University Press, Edinburgh (1990) (corrected edition)

    MATH  Google Scholar 

  32. Troelstra, A.S., van Dalen, D.: Constructivity in Mathematics, vol. I and II. North-Holland, Amsterdam (1988)

    Google Scholar 

  33. Unterhalt, M.: Kripke-Semantik für Logik mit partieller Existenz. PhD thesis, Westfälische Wilhelms-Universität Münster (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gumb, R.D. (2000). Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_22

Download citation

  • DOI: https://doi.org/10.1007/10722086_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67697-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics