2013•Journal of Information and Computational ScienceRequires access

Theory of Truth Degrees in 3-Valued Propositional Pre-rough Logic

Yingcang Ma

Abstract

By means of the function induced by a logical formula A, the truth degree’s concept of a logical formula A in the 3-valued pre-rough logic is introduced in this paper. Moreover, truth degree MP rules and truth degree HS rules are given. Lastly, we prove that the set of truth degrees is dense in [0;1]. The results of the paper enrich the studies of 3-valued pre-rough logic.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Propositional calculus, Propositional variable, Computer science, Propositional formula, Zeroth-order logic, Autoepistemic logic, Mathematics, Well-formed formula