Variants of First-Order Modal Logics

  • Marta Cialdea Mayer
  • Serenella Cerrito
Conference paper

DOI: 10.1007/10722086_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1847)
Cite this paper as:
Cialdea Mayer M., Cerrito S. (2000) Variants of First-Order Modal Logics. In: Dyckhoff R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science, vol 1847. Springer, Berlin, Heidelberg

Abstract

In this paper we study proof procedures for some variants of first order modal logics, where domains may be either cumulative or freely varying and terms may be either rigid or non-rigid, local or non-local. We define both ground and free variable tableau methods, parametric with respect to the variants of the considered logics. The treatment of each variant is equally simple and is based on the annotation of functional symbols by natural numbers, conveying some semantical information on 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 2000

Authors and Affiliations

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

Personalised recommendations