Tableaux for logic programming with strong negation
From MaRDI portal
Recommendations
Cites work
- A semantical study of constructible falsity
- An improved refutation system for intuitionistic predicate logic
- Constructible falsity
- Constructible falsity and inexact predicates
- Constructive predicate logic with strong negation and model theory
- Curry's paradox in contractionless constructive logic
- scientific article; zbMATH DE number 4160687 (Why is no real title available?)
- scientific article; zbMATH DE number 3659563 (Why is no real title available?)
- scientific article; zbMATH DE number 25191 (Why is no real title available?)
- scientific article; zbMATH DE number 559756 (Why is no real title available?)
- scientific article; zbMATH DE number 9973 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- scientific article; zbMATH DE number 3300581 (Why is no real title available?)
- Logic programming with strong negation
- Logic Programming with Strong Negation and Inexact Predicates
- On the Proof Method for Constructive Falsity
- Subformula semantics for strong negation systems
Cited in
(4)
This page was built for publication: Tableaux for logic programming with strong negation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610313)