Skip to main content

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

Abstract

Logics of binary relations corresponding, among others, to the class RRA of representable relation algebras and the class FRA of full relation algebras are presented together with the proof systems in the style of dual tableaux. Next, the logics are extended with relational constants interpreted as point relations. Applications of these logics to reasoning in non-classical logics are recalled. An example is given of a dual tableau proof of an equation which is RRA-valid, while not RA-valid.

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. Burrieza, A., Ojeda-Aciego, M., Orłowska, E.: Relational Approach to Order-of-Magnitude Reasoning. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) TARSKI 2006. LNCS, vol. 4342, pp. 105–124. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Dallien, J., MacCaull, W.: RelDT: A relational dual tableaux automated theorem prover, (preprint, 2005)

    Google Scholar 

  3. Demri, S., Orłowska, E.: Towards reasoning about Hoare relations. Annals of Mathematics and Artificial Intelligence 12, 265–289 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Demri, S., Orłowska, E.: Logical analysis of demonic nondeterministic programs. Theoretical Computer Science 202, 173–202 (1996)

    Article  Google Scholar 

  5. Formisano, A., Omodeo, E., Orłowska, E.: A PROLOG tool for relational translation of modal logics: A front-end for relational proof systems. In: Beckert, B. (ed) TABLEAUX 2005, Position Papers and Tutorial Descriptions, Universität Koblenz-Landau, Fachberichte Informatik No 12, pp. 1–10 (2005)

    Google Scholar 

  6. Formisano, A., Nicolosi Asmundo, M.: An efficient relational deductive system for propositional non-classical logics. Journal of Applied Non-Classical Logics (to appear, 2006)

    Google Scholar 

  7. Formisano, A., Omodeo, E.G., Orłowska, E.: An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) TARSKI 2006. LNCS, vol. 4342, pp. 89–104. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Frias, M., Orłowska, E.: A proof system for fork algebras and its applications to reasoning in logics based on intuitionism. Logique et Analyse, 150-151-152, 239-284 (1995)

    Google Scholar 

  9. Golińska-Pilarek, J., Orłowska, E.: Tableaux and dual Tableaux: Transformation of proofs. In: Studia Logica (to appear, 2006)

    Google Scholar 

  10. Konikowska, B., Morgan, C., Orłowska, E.: A relational formalisation of arbitrary finite-valued logics. Logic Journal of IGPL 6(5), 755–774 (1998)

    Article  MATH  Google Scholar 

  11. MacCaull, W.: Relational proof theory for linear and other substructural logics. Logic Journal of IGPL 5, 673–697 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. MacCaull, W.: Relational tableaux for tree models, language models and information networks. In: Orłowska, E. (ed.) Logic at Work. Essays dedicated to the memory of Helena Rasiowa. Springer, Heidelberg (1998a)

    Google Scholar 

  13. MacCaull, W.: Relational semantics and a relational proof system for full Lambek Calculus. Journal of Symbolic Logic 63(2), 623–637 (1998b)

    Article  MATH  MathSciNet  Google Scholar 

  14. MacCaull, W., Orłowska, E.: Correspondence results for relational proof systems with applications to the Lambek calculus. Studia Logica 71, 279–304 (2002)

    Article  Google Scholar 

  15. Orłowska, E.: Relational interpretation of modal logics. In: Andreka, H., Monk, D., Nemeti, I. (eds.) Algebraic Logic, Colloquia Mathematica Societatis Janos Bolyai, vol. 54, pp. 443–471. North Holland, Amsterdam (1988)

    Google Scholar 

  16. Orłowska, E.: Relational proof systems for relevant logics. Journal of Symbolic Logic 57, 1425–1440 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Orłowska, E.: Dynamic logic with program specifications and its relational proof system. Journal of Applied Non-Classical Logic 3, 147–171 (1993)

    MATH  Google Scholar 

  18. Orłowska, E.: Relational semantics for non-classical logics: Formulas are relations. In: Woleński, J. (ed.) Philosophical Logic in Poland, pp. 167–186. Kluwer, Dordrecht (1994)

    Google Scholar 

  19. Orłowska, E.: Temporal logics in a relational framework. In: Bolc, L., Szałas, A. (eds.) Time and Logic-a Computational Approach, pp. 249–277. University College London Press (1995)

    Google Scholar 

  20. Orłowska, E.: Relational proof systems for modal logics. In: Wansing, H. (ed.) Proof Theory of Modal Logics, pp. 55–77. Kluwer, Dordrecht (1996)

    Google Scholar 

  21. Orłowska, E.: Relational formalisation of non-classical logics. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science, pp. 90–105. Springer, Wien/New York (1997)

    Google Scholar 

  22. Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics. Polish Scientific Publishers, Warsaw (1963)

    MATH  Google Scholar 

  23. Schmidt, G., Ströhlein, T.: Relations and graphs. In: EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg

    Google Scholar 

  24. Tarski, A.: On the calculus of relations. The Journal of Symbolic Logic 6, 73–89 (1941)

    Article  MATH  MathSciNet  Google Scholar 

  25. Tarski, A., Givant, S.R.: A Formalization of Set Theory without Variables. vol. 41. Colloquium Publications, American Mathematical Society (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golińska-Pilarek, J., Orłowska, E. (2006). Relational Logics and Their Applications. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds) Theory and Applications of Relational Structures as Knowledge Instruments II. Lecture Notes in Computer Science(), vol 4342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11964810_7

Download citation

  • DOI: https://doi.org/10.1007/11964810_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69223-2

  • Online ISBN: 978-3-540-69224-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics