Abstract
The paper presents a set-theoretic translation method for polymodal logics that reduces the derivability problem of a large class of propositional polymodal logics to the derivability problem of a very weak first-order set theory Ω. Unlike most existing translation methods, the one we propose applies to any normal complete finitely-axiomatizable polymodal logic, regardless if it is first-order complete. Moreover, the finite axiomatizability of Ω makes it possible to implement mechanical proof search procedures via the deduction theorem or more specialized and efficient techniques. In the last part of the paper, we briefly discuss the application of set T-resolution to support automated derivability in (a suitable extension of) Ω.
This work has been supported by funds MURST 40% and 60%. The second author was supported by a grant from the Italian Consiglio Nazionale delle Ricerche (CNR).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Aczel, Non-well-founded sets, CSLI, Lecture Notes No. 14, 1988.
J. van Benthem, Modal Logic and Classical Logic; Bibliopolis, Napoli and Atlantic Heights (N.J.), 1985.
J. van Benthem, G. D'Agostino, A. Montanari, A. Policriti, Modal Deduction in Second-Order Logic and Set Theory (in preparation).
D. Cantone, A. Ferro, and E.G. Omodeo, Computable Set Theory. Vol. 1; Oxford University Press, Int. Series of Monographs on Computer Science, 1989.
G. D'Agostino, A. Montanari, A. Policriti, Translating modal formulae as settheoretic terms; Research Report 10/94, Dipartimento di Matematica e Informatica, Università di Udine, May 1994 (an abstract will appear in the Proc. of Logic Colloquium '94, Journal of Symbolic Logic).
G. D'Agostino, A. Montanari, A. Policriti, A set-theoretic translation method for polymodal logics; The ILLC Prepublication Series, ML-94-09, University of Amsterdam, October 1994.
G. D'Agostino, A. Montanari, A. Policriti, Decidability results for modal theorem proving (in preparation).
M. Fitting, Proofs Methods for Modal and Intuitionistic Logics; D. Reidel Pub. Comp., Dordrecht, Boston, and Lancaster, 1983.
D. M. Gabbay, H. J. Ohlbach, Quantifier elimination in second-order predicate logic; in Proc. KR'92, Morgan Kaufmann, 1992, 425–436.
H. J. Ohlbach, Translation Methods for Non-Classical Logics: An Overview; Bull. of the IGLP, 1 (1): 69–89, 1993.
A. Policriti, J. T. Schwartz, T Theorem Proving I; Research Report 08/92, Università di Udine, July 1992 (submitted for publication).
C. Smoryński, Self-Reference and Modal Logic; Springer Verlag, New York, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D'Agostino, G., Montanari, A., Policriti, A. (1995). A set-theoretic translation method for (poly)modal logics. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_75
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive