2000 character limit reached
Arboles de Forzamiento Semántico Trivalentes para el sistema deductivo paraconsistente P1
Published 3 Oct 2023 in math.LO | (2310.01989v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.