• Firstly, to prove a language is decidable, you need to create a Turing Machine that will halt on any input string from the language's alphabet. In this instance, G ={ | K is a propositional sentence that has at least 2 valuations that make it true}. I'm assuming that, as your question states "at least 1 value" then you understand that the language isn't finite (as all finite languages are decidable). You can prove that G is decidable quite easily actually. This is because we can confirm that the propositional word has at the least two valuations that make it authentic for all the given propositional assertions. Since it does, the sentence is within the language G for any given sentence. We can test whether a propositional assertion has the least valuations that make it authentic for any give proposition. I hope this answers your question!

Copyright 2020, Wired Ivy, LLC

Answerbag | Terms of Service | Privacy Policy