Proof theory and mathematical meaning of paraconsistent C-systems

DOI10.1016/J.JAL.2011.04.001zbMATH Open1242.03056OpenAlexW2092068361MaRDI QIDQ420832FDOQ420832

Authors: Paolo Gentilini 

Publication date: 23 May 2012

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2011.04.001

Recommendations

• Paraconsistency and the C-systems of da Costa
• Paraconsistent arithmetic with a local consistency operator and global selfreference
• scientific article; zbMATH DE number 2019859
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Proving contradictions in formal theories. I

zbMATH Keywords

proof theoryparaconsistent logicarithmetical semanticsclassical provability logic of PA as a model of paraconsistencyfoundations of constructive paraconsistent mathematics

Mathematics Subject Classification ID

Paraconsistent logics (03B53) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Cites Work

• Handbook of proof theory
• Dual-intuitionistic logic
• Anti-intuitionism and paraconsistency
• On the theory of inconsistent formal systems
• Title not available (Why is that?)
• Limits for paraconsistent calculi
• Title not available (Why is that?)
• Logics of formal inconsistency
• Proof theory. 2nd ed
• Title not available (Why is that?)
• LK, LJ, dual intuitionistic logic, and quantum logic
• Title not available (Why is that?)
• Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency
• Title not available (Why is that?)
• Proof-theoretic modal PA-completeness. I: A system-sequent metric
• Proof-theoretic modal PA-completeness. II: The syntactic countermodel
• Proof-theoretic modal PA-completeness. III: The syntactic proof
• Paraconsistent arithmetic with a local consistency operator and global selfreference
• Title not available (Why is that?)
• Paraconsistent conjectural deduction based on logical entropy measures. I: \(C\)-systems as non-standard inference framework
• Inconsistent models for relevant arithmetics
• PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Paraconsistent conjectural deduction based on logical entropy measures. I: \(C\)-systems as non-standard inference framework
• The Interpretation Lifting Theorem for C-Systems
• A new technique for proving realisability and consistency theorems using finite paraconsistent models of cut-free logic
• Efficient reasoning with inconsistent information using C-systems

This page was built for publication: Proof theory and mathematical meaning of paraconsistent C-systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420832)