Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation

  • Serenella Cerrito
  • Marta Cialdea Mayer
Conference paper

DOI: 10.1007/3-540-45744-5_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2083)
Cite this paper as:
Cerrito S., Mayer M.C. (2001) Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation. In: Goré R., Leitsch A., Nipkow T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg

Abstract

This paper presents a sound and complete free-variable tableau calculus for constant-domain quantified modal logics, with a propositional analytical basis, i.e. one of the systems K, D, T, K4, S4. The calculus is obtained by addition of the classical free-variable γ-rule and the “liberalized” δ+-rule [14] to a standard set of propositional rules. Thus, the proposed system characterizes proof-theoretically the constant-domain semantics, which cannot be captured by “standard” (non-prefixed, non-annotated) ground tableau calculi. The calculi are extended so as to deal also with non-rigid designation, by means of a simple numerical annotation on functional symbols, conveying some semantical information about the worlds where they are meant to be interpreted.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Serenella Cerrito
    • 1
  • Marta Cialdea Mayer
    • 2
  1. 1.L.R.I.Université de Paris-SudFrance
  2. 2.Dipartimento di Informatica e AutomazioneUniversità di Roma TreItaly

Personalised recommendations