×

Retracted article: “A completeness theorem for continuous predicate modal logic”. (English) Zbl 1400.03038

From the text: The Editor-in-Chief is retracting this article because it was published in error before undergoing peer review. The author agrees with this retraction and will be resubmitting his manuscript for review. The Editor-in-Chief apologizes to the author and to readers. The online version of this article contains the full text of the retracted article as electronic supplementary material.

MSC:

03B45 Modal logic (including the logic of norms)
Full Text: DOI

References:

[1] Baratella, S.: Continuous propositional · Zbl 1372.03089
[2] Ben Yaacov, I., Berenstein, A., Henson, C.W., Usvyatsov, A.: Model theory for metric structures. In: Chatzidakis, Z., Macpherson, D., Pillay, A., Wilkie, A. (eds.) Model theory with applications to algebra and analysis. Lecture notes series of the London mathematical society 350, vol. II, pp. 315–427. Cambridge University Press, Cambridge (2008) · Zbl 1233.03045
[3] Ben, Yaacov I., Pedersen, P.: A proof of completeness for continuous first-order logic. J. Symb. Logic 75–1, 168–190 (2010) · Zbl 1194.03028
[4] Ben Yaacov, I., Usvyatsov, A.: Continuous first order logic and local stability. Trans. Am. Math. Soc. 362–10, 5213–5259 (2010) · Zbl 1200.03024 · doi:10.1090/S0002-9947-10-04837-3
[5] Fitting, M.: Many-valued modal logics. Fund. Inform. 15(3–4), 235–254 (1991) · Zbl 0745.03018
[6] Hughes, G.E., Cresswell, M.J.: A new introduction to modal logic. Routledge, New York (2005) · Zbl 0855.03002
[7] Priest, G.: Many-valued modal logics: a simple approach. The review of symbolic logic 1–2, 190–203 (2008) · Zbl 1206.03022
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.