Skip to main content

A Decidable First-Order Logic for Medical Reasoning

  • Conference paper
Knowlege-Based and Intelligent Information and Engineering Systems (KES 2011)

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

Abstract

This paper is intended to construct a decidable first-order logic for appropriately expressing medical reasoning which may require to express not only time-dependency, paraconsistency, constructiveness, resource-sensitivity, but also order-sensitivity. A first-order temporal paraconsistent non-commutative logic is introduced as a Gentzen-type sequent calculus. This logic has no structural rules and has some bounded temporal operators and a paraconsistent negation connective. This logic is shown to be decidable and cut-eliminable.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Girard, J.-Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hodkinson, I., Wolter, F., Zakharyaschev, M.: Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic 106, 85–134 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kamide, N.: Linear and affine logics with temporal, spatial and epistemic operators. Theoretical Computer Science 353(1–3), 165–207 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kamide, N.: Linear exponentials as resource operators: A decidable first-order linear logic with bounded exponentials. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 245–257. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Kamide, N.: Temporal non-commutative logic: expressing time, resource, order and hierarchy. Logic and Logical Philosophy 18, 97–126 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kawai, H.: Sequential calculus for a first order infinitary temporal logic. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 33, 423–432 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  7. Komori, Y.: Predicate logics without the structure rules. Studia Logica 45, 393–404 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lambek, J.: The mathematics of sentence structure. The American Mathematical Monthly 65, 154–170 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  9. Nelson, D.: Constructible falsity. Journal of Symbolic Logic 14, 16–26 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  10. Wagner, G.: Logic programming with strong negation and inexact predicates. Journal of Logic and Computation 1(6), 835–859 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  11. Wansing, H.: The Logic of Information Structures. LNCS (LNAI), vol. 681, pp. 1–163. Springer, Heidelberg (1993)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamide, N. (2011). A Decidable First-Order Logic for Medical Reasoning. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds) Knowlege-Based and Intelligent Information and Engineering Systems. KES 2011. Lecture Notes in Computer Science(), vol 6882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23863-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23863-5_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23862-8

  • Online ISBN: 978-3-642-23863-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics