On a generalization of the principle \textit{reductio ad absurdum}

zbMATH Open1249.03034MaRDI QIDQ2885196FDOQ2885196

Authors: S. P. Odintsov 

Publication date: 21 May 2012

Published in: Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

Recommendations

• “Reductio ad absurdum” and Łukasiewicz’s modalities
• Some definitions of negation leading to paraconsistent logics
• Paraconsistent logic from a modal viewpoint
• On negation: Pure local rules
• Constructive negations and paraconsistency

zbMATH Keywords

paraconsistent logicinferential calculus

Mathematics Subject Classification ID

Paraconsistent logics (03B53)

Cited In (7)

• RAA-coherent logics which are not RAA-extended are non-monotonic
• Title not available (Why is that?)
• On the reducibility of hypotheses and consequences
• Reductio ad Absurdum in a full-fledged dialogical framework
• Reductio ad contradictionem: an algebraic perspective
• Title not available (Why is that?)
• “Reductio ad absurdum” and Łukasiewicz’s modalities

This page was built for publication: On a generalization of the principle \textit{reductio ad absurdum}

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