Limits for paraconsistent calculi

DOI10.1305/ndjfl/1022615617zbMath1007.03028WikidataQ61593393 ScholiaQ61593393MaRDI QIDQ701299

João Marcos, Walter Alexandre Carnielli

Publication date: 27 March 2003

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1022615617

zbMATH Keywords

decision procedure; da Costa's hierarchy; deductive limits; possible-translation semantics

Mathematics Subject Classification ID

03B53: Paraconsistent logics

Related Items

Modulated fibring and the collapsing problem, A non-deterministic view on non-classical negations, Paraconsistent informational logic, Anti-intuitionism and paraconsistency, On negation: Pure local rules, Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework, Possible-translations semantics for some weak classically-based paraconsistent logics

Cites Work

• Zooming in, zooming out
• Variations on da Costa C systems and dual-intuitionistic logics. I: Analyses of \(C_{\omega}\) and \(CC_{\omega}\)
• Paraconsistent logic and model theory
• Kripke-type semantics for Da Costa's paraconsistent logic \(C_{\omega}\)
• A semantical analysis of the calculi \(C_n\)
• Maximal weakly-intuitionistic logics
• Propositional calculus for contradictory deductive systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item