Skip to main content
SpringerLink
Log in

Discipline as Logic: Treating Labels as First Class Citizens

  • Chapter
Labelled Deduction

Part of the book series: Applied Logic Series ((APLS,volume 17))

Abstract

This paper discusses modal labelled deduction from the perspective offered by hybrid languages. In essence, hybrid languages are modal languages in which the apparatus of labelled deduction is fully integrated into the object language. Hybrid languages enable us to define proof systems which in an obvious sense internalize labelled deduction, and when this is done, we shall find that labelling discipline emerges as logic. I show that this logical (or declarative) perspective on labelling discipline can be “lifted” to a full first-order discipline over labels, and conclude with some general remarks on hybridization

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. J. Allen. Towards a general theory of action and time.Artificial Intelligence,23(2):123–154, July 1984.

    Article  Google Scholar 

  2. C. Areces, P. Blackburn, and M. Marx. Hybrid logics. Characterization, interpolation and complexity. Technical Report CLAUS-Report 104, Computerlinguistik, Universität des Saarlandes, 1999.http://www.coli.unisb.de/cl/claus

    Google Scholar 

  3. D. Basin, S. Matthews, and L. Viganb. Labelled propositional modal logics: Theory and practice.Journal of Logic and Computation, 7:685–717, 1997.

    Article  Google Scholar 

  4. J. van Benthem. Correspondence theory. In D. Gabbay and F, Guenthner, editorsHandbook of Philosophical Logic, volume 2, pages 167–247. Reidel, Dordrecht, 1984.

    Google Scholar 

  5. P. Blackburn. Fine grained theories of time. Manuscript, 1999.

    Google Scholar 

  6. P. Blackburn. Modal logic and attribute value structures. In M. de Rijke, editorDiamonds and Defaults, Synthese Language Library, pages 19–65. Kluwer Academic Publishers, Dordrecht, 1993.

    Google Scholar 

  7. P. Blackburn. Tense, temporal reference, and tense logic.Journal of Semantics 11:83–101 1994.

    Article  Google Scholar 

  8. P. Blackburn. Internalizing labelled deduction. Technical Report CLAUS-Report 102, Computerlinguistik, Universität des Saarlandes, 1998. http://www.coli.unisb.de/cl/c1aus To appear in theJournal of Logic and Computation.

    Google Scholar 

  9. P. Blackburn and J. Seligman. Hybrid languages.Journal of Logic Language and Information, 4(3):251–272, 1995.

    Article  Google Scholar 

  10. P. Blackburn and J. Seligman. What are hybrid languages? In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editorsAdvances in Modal Logic, volume 1, pages 41–62. CSLI Publications, Stanford University, 1998.

    Google Scholar 

  11. R Blackburn and E. Spaan. A modal perspective on the computational complexity of attribute value grammar.Journal of Logic Language and Information, 2(2):129–169, 1993.

    Article  Google Scholar 

  12. P. Blackburn and M. Tzakova. Hybrid completeness.Logic Journal of the IGPL,6:625–650, 1998.

    Article  Google Scholar 

  13. R Blackburn and M. Tzakova. Hybridizing concept languages.Annals of Mathematics and Artificial Intelligence, 24:23–49, 1998.

    Article  Google Scholar 

  14. R Blackburn and M. Tzakova. Hybrid languages and temporal logics.Logic Journal of the IGPL, 7(1):27–54,1999.

    Article  Google Scholar 

  15. R. Bull. An approach to tense logic.Theoria, 36:282–300, 1970.

    Article  Google Scholar 

  16. S. Demri. Sequent calculi for nominal tense logics: a step towards mechanization? In N. Murray, editorConference on Tableaux Calculi and Related Methods (TABLEAUX) Saratoga Springs USA, volume 1617 ofLNAI,pages 140–154. Springer Verlag, 1999.

    Google Scholar 

  17. S. Demri and R. Gore. Cut-free display calculi for nominal tense logics. In N. Murray, editorConference on Tableaux Calculi and Related Methods (TABLEAUX) Saratoga Springs USA,volume 1617 ofLNAI,pages 155–170. Springer Verlag, 1999.

    Google Scholar 

  18. D. Gabbay. An irreflexivity lemma with applications to axiomatizations of conditions on linear frames. In U. Mönnich, editorAspects of Philosophical Logic, pages 67–89. Reidel, Dordrecht, 1981.

    Chapter  Google Scholar 

  19. D. Gabbay.Labelled Deductive Systems.Clarendon Press, Oxford, 1996.

    Google Scholar 

  20. G. Gargov and V. Goranko. Modal logic with names.Journal of Philosophical Logic, 22:607–636, 1993.

    Article  Google Scholar 

  21. V. Goranko. Hierarchies of modal and temporal logics with reference pointers.Journal of Logic Language and Information, 5(1):1–24,1996.

    Google Scholar 

  22. B. Konikowska. A logic for reasoning about relative similarity.Studia Logica, 58:185–226, 1997.

    Article  Google Scholar 

  23. R. Ladner. The computational complexity of provability in systems of modal propositional logic.SIAM Journal of Computing,6(3):467–480, 1977.

    Article  Google Scholar 

  24. S. Passy and T. Tinchev. Quantifiers in combinatory PDL: completeness, definability, incompleteness. InFundamentals of Computation Theory FCT 85, volume 199 ofLNCS,pages 512–519. Springer, 1985.

    Article  Google Scholar 

  25. S. Passy and T. Tinchev. An essay in combinatory dynamic logic.Information and Computation,93:263–332, 1991.

    Article  Google Scholar 

  26. A. Prior. Past, Present and Future. Oxford University Press, 1967.

    Google Scholar 

  27. A. Prior and K. Fine.Worlds Times and Selves.University of Massachusetts Press, 1977.

    Google Scholar 

  28. M. Reape. A feature value logic. In C. Rupp, M. Rosner, and R. Johnson, editorsConstraints Language and Computation, Synthese Language Library, pages 77–110. Academic Press, 1994.

    Google Scholar 

  29. H. Sahlqvist. Completeness and correspondence in the first and second order semantics for modal logic. In S. Kanger, editorProceedings of the Third Scandinavian Logic Symposium. Uppsala 1973., pages 110–143. North-Holland, Amsterdam, 1975.

    Chapter  Google Scholar 

  30. M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements.Artificial Intelligence, 48:1–26, 1991.

    Article  Google Scholar 

  31. J. Seligman. A cut-free sequent calculus for elementary situated reasoning. Technical Report HCRC-RP 22, HCRC, Edinburgh, 1991.

    Google Scholar 

  32. J. Seligman. Situated consequence for elementary situation theory. Technical Report Logic Group Preprint IULG-92–16, Indiana University, 1992.

    Google Scholar 

  33. J. Seligman. The logic of correct description. In M. de Rijke, editorAdvances in Intensional Logic,pages 107–135. Kluwer, 1997.

    Google Scholar 

  34. R. Smullyan. First-Order Logic. Springer Verlag, 1968.

    Google Scholar 

  35. M. Tzakova. Tableaux calculi for hybrid logics. In N. Murray, editorConference on Tableaux Calculi and Related Methods (TABLEAUX) Saratoga Springs USA,volume 1617 ofLNAI,pages 278–292. Springer Verlag, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computerlinguistik, Universität des Saarlandes, Saarbrücken, D-66041, Germany

    Patrick Blackburn

Authors
  1. Patrick Blackburn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Albert-Ludwigs-Universität Freiburg, Germany

    David Basin  & Luca Viganò  & 

  2. Università di Ferrara, Italy

    Marcello D’Agostino

  3. Department of Computer Science, King’s College, London, UK

    Dov M. Gabbay

  4. Logical GmbH, Frankfurt am Main, Germany

    Seán Matthews

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Blackburn, P. (2000). Discipline as Logic: Treating Labels as First Class Citizens. In: Basin, D., D’Agostino, M., Gabbay, D.M., Matthews, S., Viganò, L. (eds) Labelled Deduction. Applied Logic Series, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4040-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-4040-9_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5781-3

  • Online ISBN: 978-94-011-4040-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation