2012/02/27 by Xavier Caicedo, Caicedo, Xavier, José Iovino +1
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Topology and Set Theory #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge #math.LO
paper · pdf · doi:10.48550/arxiv.1202.5981
arxiv created 2012/02/27 · openalex publication_date 2012/02/27 · arxiv updated 2012/02/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study [0,1]-valued logics that are closed under the Łukasiewicz-Pavelka connectives; our primary examples are the the continuous logic framework of Ben Yaacov and Usvyatsov \citeBen-Yaacov-Usvyatsov:2010 and the Łukasziewicz-Pavelka logic itself. The main result of the paper is a characterization of these logics in terms of a model-theoretic property, namely, an extension of the omitting types theorem to uncountable languages.