Proof theory and mathematical meaning of paraconsistent C-systems

DOI10.1016/j.jal.2011.04.001zbMath1242.03056MaRDI QIDQ420832

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

zbMATH Keywords

proof theory; paraconsistent logic; arithmetical semantics; classical provability logic of PA as a model of paraconsistency; foundations of constructive paraconsistent mathematics

Mathematics Subject Classification ID

03F30: First-order arithmetic and fragments

03B53: Paraconsistent logics

03F45: Provability logics and related algebras (e.g., diagonalizable algebras)

Related Items

Efficient reasoning with inconsistent information using C-systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LK, LJ, dual intuitionistic logic, and quantum logic
• Limits for paraconsistent calculi
• Proof theory. 2nd ed
• Handbook of proof theory
• Dual-intuitionistic logic
• Anti-intuitionism and paraconsistency
• 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
• On the theory of inconsistent formal systems
• 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
• Logics of Formal Inconsistency
• Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency