Unification problem in Nelson's logic N4

MaRDI QIDQ892014zbMATH OpenFDO

Authors S. P. Odintsov, Vladimir Rybakov

Publication date 18 November 2015

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL http://semr.math.nsc.ru/v11/p434-443.pdf

zbMATH Keywords

decidabilitystrong negationunificationcomplete sets of unifiersNelson's logicVorob'ev translation

Mathematics Subject Classification ID

Paraconsistent logics (03B53)

Recommendations

• Unifiability in extensions of K4
• An embedding-based completeness proof for Nelson's paraconsistent logic
• Unifiers in transitive modal logics for formulas with coefficients (meta-variables)
• Writing out unifiers for formulas with coefficients in intuitionistic logic
• Remarks about the unification type of several non-symmetric non-transitive modal logics

Cited in

(2)

• Unification in Linear Modal Logic on Non-transitive Time with the Universal Modality
• Writing out unifiers for formulas with coefficients in intuitionistic logic

This page was built for publication: Unification problem in Nelson's logic \(\mathbf{N4}\)

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