See the published version of this preprint at Soft Computing.
This is a preprint, a preliminary version of a manuscript that has not completed peer review at a journal. Research Square does not conduct peer review prior to posting preprints. The posting of a preprint on this server should not be interpreted as an endorsement of its validity or suitability for dissemination as established information or for guiding clinical practice.
Learn more about In Review
A new preprint design is coming!
We have improved readability, clarity, accessibility, and opportunities for engagement.
Research Article
License:
This work is licensed under a CC BY 4.0 License. Read Full License
In this article, we propose 3-valued semantics of the logics compatible with Stone and dual Stone algebras. We show that these logics can be considered as 3-valued by establishing soundness and completeness results. We also show that rough set theory can be modelled by these logics where the third value can be interpreted as not certain but possible.
Keywords
Stone algebras, 3-valued logic, Rough sets
Figure 1
Loading...
Badges
Prescreen
This manuscript passed our Prescreen assessment
Complete author information
Appropriate declaration statements
Potential risks to human health
Prescreen
Peer Review Timeline
CURRENT STATUS: Published
View the published article at Soft Computing.
Version 1
Posted 04 Jun, 2021
No community comments so far
Editorial decision: Accept
On 21 Jul, 2021
Reviews received
Received 01 Jun, 2021
Reviewers invited
Invitations sent on 01 Jun, 2021
First submitted
On 30 May, 2021
Metrics
Comments: 0
PDF Downloads: ...
HTML Views: ...
Subject Areas
Computer Architecture and Engineering
Learn more about our company.
A new preprint design is coming!
We have improved readability, clarity, accessibility, and opportunities for engagement.
See the published version of this preprint at Soft Computing.
This is a preprint, a preliminary version of a manuscript that has not completed peer review at a journal. Research Square does not conduct peer review prior to posting preprints. The posting of a preprint on this server should not be interpreted as an endorsement of its validity or suitability for dissemination as established information or for guiding clinical practice.
Learn more about In Review
Research Article
Badges
Prescreen
This manuscript passed our Prescreen assessment
Complete author information
Appropriate declaration statements
Potential risks to human health
Prescreen
Peer Review Timeline
CURRENT STATUS: Published
View the published article at Soft Computing.
Version 1
Posted 04 Jun, 2021
No community comments so far
Editorial decision: Accept
On 21 Jul, 2021
Reviews received
Received 01 Jun, 2021
Reviewers invited
Invitations sent on 01 Jun, 2021
First submitted
On 30 May, 2021
Metrics
Comments: 0
PDF Downloads: ...
HTML Views: ...
Subject Areas
Computer Architecture and Engineering
License:
This work is licensed under a CC BY 4.0 License. Read Full License
View the published article at Soft Computing.
In this article, we propose 3-valued semantics of the logics compatible with Stone and dual Stone algebras. We show that these logics can be considered as 3-valued by establishing soundness and completeness results. We also show that rough set theory can be modelled by these logics where the third value can be interpreted as not certain but possible.
Figure 1
Loading...