Finite tree-countermodels via refutation systems in extensions of positive logic with strong negation

DOI10.1007/S11787-023-00338-8OpenAlexW4386736356MaRDI QIDQ6146289

Tomasz Skura

Publication date: 10 January 2024

Published in: Logica Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11787-023-00338-8

zbMATH Keywords

strong negationrefutation systemscountermodel constructionsextensions of positive logicthe connexive logic \textbf{C}

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Subsystems of classical logic (including intuitionistic logic) (03B20)

Cites Work

• Refutations, proofs, and models in the modal logic K4
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite tree-countermodels via refutation systems in extensions of positive logic with strong negation