Arboles de Forzamiento Sem\'antico Trivalentes para el sistema deductivo paraconsistente P1
Manuel Sierra Aristizabal

TL;DR
This paper introduces a visual inference method using trivalent semantic forcing trees to evaluate the validity of formulas in the paraconsistent logic system P1, enhancing understanding of its semantics.
Contribution
It presents a novel graphical inference tool for the semantics of P1, linking trivalent truth tables with visual forcing trees for better analysis.
Findings
The semantic forcing trees effectively determine formula validity.
The method identifies refutations through leaf markings.
It provides a visual approach to paraconsistent logic semantics.
Abstract
The semantics of trivalent truth tables for the paraconsistent logic system P1, is characterized by a visual inference tool called trivalent semantic forcing trees. Given a formula, with this tool the nodes of the corresponding tree are marked, and it is determined whether the formula is valid or not. In case the formula is invalid, the assignment of truth values that refutes it is determined by the marks of the leaves in its forcing tree.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Formal Methods in Verification · Logic, Reasoning, and Knowledge
