Skip to main content
Log in

A completeness theorem for continuous predicate modal logic

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We study a modal extension of the Continuous First-Order Logic of Ben Yaacov and Pedersen (J Symb Logic 75(1):168–190, 2010). We provide a set of axioms for such an extension. Deduction rules are just Modus Ponens and Necessitation. We prove that our system is sound with respect to a Kripke semantics and, building on Ben Yaacov and Pedersen  (2010), that it satisfies a number of properties similar to those of first-order predicate logic. Then, by means of a canonical model construction, we get that every consistent set of formulas is satisfiable. From the latter result we derive an Approximated Strong Completeness Theorem, in the vein of Continuous Logic, and a Compactness Theorem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Baratella, S.: Continuous Propositional Modal Logic. Submitted. http://www.science.unitn.it/~baratell/CPropML.pdf

  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, vol. II. Lecture Notes Series of the London Mathematical Society, pp. 315–427. Cambridge University Press, Cambridge (2008)

    Chapter  Google Scholar 

  3. Ben Yaacov, I., Pedersen, P.: A proof of completeness for continuous first-order logic. J. Symb. Logic 75–1, 168–190 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ben Yaacov, I., Usvyatsov, A.: Continuous first order logic and local stability. Trans. Am. Math. Soc. 362–10, 5213–5259 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fitting, M.: Many-valued modal logics. Fund. Inform. 15(3–4), 235–254 (1991)

    MathSciNet  MATH  Google Scholar 

  6. Hughes, G.E., Cresswell, M.J.: A New Introduction to Modal Logic. Routledge, New York (2005)

    MATH  Google Scholar 

  7. Priest, G.: Many-valued modal logics: a simple approach. Rev. Symb. Logic 1–2, 190–203 (2008)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefano Baratella.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Baratella, S. A completeness theorem for continuous predicate modal logic. Arch. Math. Logic 58, 183–201 (2019). https://doi.org/10.1007/s00153-018-0630-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-018-0630-7

Keywords

Mathematics Subject Classification

Navigation