Answers are grounded in this paper and cite their sources.
This paper modifies MSSG-logic to represent boolean satisfiability problems (SAT), suggesting implications for philosophy and computer science.
This paper outlines the logical system of MSSG-logic originally developed by the author to represent a particular theory in analytic philosophy of language. That was a theory by philosopher Paul Grice that proposed to consider the intention of the speaker as an important context for the definition of the true meaning of his speech act. MSSG-logic proposes to use special sets of symbols for the additional interpretation of the logical formulas as well as the supersets of these sets ("trees of messages") with defined algebras on them for more complex cases. This particular paper proposes to modify the "linguistic" MSSG-logic to represent the famous computer science boolean satisfiability problems (SAT) with the similar tools. The consequences for computer science and philosophy of language are also discussed
No takes yet. Share an insight, caveat, or question.
Iaroslav Petik (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: