A reasoning method for a paraconsistent logic

DOI10.1007/BF01058392MaRDI QIDQ687160zbMATH OpenFDO

Authors Arthur Buchsbaum, Tarcisio Pequeno

Publication date 26 September 1994

Published in Studia Logica (Search for Journal in Brave)

zbMATH Keywords

paraconsistencycompletenessimplementationsoundnesstableau systemautomation of reasoningparaconsistent predicate calculus \(C^*_ 1\)

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Mechanization of proofs and logical operations (03B35)

Recommendations

• Automatic reasoning in paraconsistent logic
• Analytical tableaux for da Costa's paraconsistent predicate calculi C\(_n^*\)
• Towards an efficient prover for the \(C_1\) paraconsistent logic
• scientific article; zbMATH DE number 4164174
• Efficient reasoning with inconsistent information using C-systems

Cites work

• scientific article; zbMATH DE number 140409 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A logic for default reasoning
• On the theory of inconsistent formal systems

Cited in

(9)

• A logic for reasoning with inconsistency
• A logical expression of reasoning
• A Logic for Ambiguous Description
• Analytical tableaux for da Costa's paraconsistent predicate calculi C\(_n^*\)
• A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics
• Reducing Preferential Paraconsistent Reasoning to Classical Entailment
• A method of defining paraconsistent tableaus
• Analytical tableaux for da Costa's hierarchy of paraconsistent logics \(C_n\), \(1\leq n<\omega\)
• Towards an efficient prover for the \(C_1\) paraconsistent logic

This page was built for publication: A reasoning method for a paraconsistent logic

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