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 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.

Cialdea, M., Cerrito, S. (2001). Free-Variable Tableaux for Constant-Domain Quantified Modal Logic with Rigid and Non-rigid Designation. In Automated Reasoning. First International Joint Conference, IJCAR2001 (pp.137-151). BERLIN HEIDELBERG : Springer-Verlag [10.10.1007/3-540-45744-5_11].

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

CIALDEA, Marta;
2001-01-01

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 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.
2001
Cialdea, M., Cerrito, S. (2001). Free-Variable Tableaux for Constant-Domain Quantified Modal Logic with Rigid and Non-rigid Designation. In Automated Reasoning. First International Joint Conference, IJCAR2001 (pp.137-151). BERLIN HEIDELBERG : Springer-Verlag [10.10.1007/3-540-45744-5_11].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11590/181578
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? ND
social impact