Omitting uncountable types, and the strength of $[0,1]$-valued logics

Details Omitting uncountable types, and the strength of $[0,1]$-valued logics Omitting uncountable types, and the strength of $[0,1]$-valued logics

2012-02-27

arxiv.org/abs/1202.5981v1

Mathematics

Logic

Scientific paper

We study $[0,1]$-valued logics that are closed under the {\L}ukasiewicz-Pavelka connectives; our primary examples are the the continuous logic framework of Ben Yaacov and Usvyatsov \cite{Ben-Yaacov-Usvyatsov:2010} and the {\L}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.

Affiliated with

Also associated with

No associations

Rating

Omitting uncountable types, and the strength of $[0,1]$-valued logics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Omitting uncountable types, and the strength of $[0,1]$-valued logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Omitting uncountable types, and the strength of $[0,1]$-valued logics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263826