On the public citation graph
The Craig interpolation theorem for prepositional logics with strong negation
0 signed · 23 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00403332openalex-snapshot
Logical matrices and the amalgamation property
inferredcites →https://doi.org/10.1007/bf02121118openalex-snapshot
Notes on N-lattices and constructive logic with strong negation
inferredcites →https://doi.org/10.1016/s0049-237x(09)x7004-7openalex-snapshot
An Algebraic Approach to Non-Classical Logics
inferredcites →https://doi.org/10.4064/cm-6-1-287-310openalex-snapshot
On constructible falsity in the constructive logic with strong negation
inferredcites →https://doi.org/10.4064/fm-46-1-61-80openalex-snapshot
N-lattices and constructive logic with strong negation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11546207_27openalex-snapshot
Routley Semantics for Answer Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-15368-1_22openalex-snapshot
Belnap Constants and Nelson Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_7openalex-snapshot
Necessary Conditions for Negation-Operators (with Particular Applications to Paraconsistent Negation)
inferred← citeshttps://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferred← citeshttps://doi.org/10.1007/bf00401557openalex-snapshot
Nelson algebras through Heyting ones: I
inferred← citeshttps://doi.org/10.1007/bf01057804openalex-snapshot
Axiomatic extensions of the constructive logic with strong negation and the disjunction property
inferred← citeshttps://doi.org/10.1007/s10469-006-0021-8openalex-snapshot
Transfer theorems for extensions of the paraconsistent Nelson logic
inferred← citeshttps://doi.org/10.1007/s11202-007-0012-6openalex-snapshot
On extensions of Nelson’s logic satisfying Dummett’s axiom
inferred← citeshttps://doi.org/10.1007/s11225-005-8472-9openalex-snapshot
The Class of Extensions of Nelson's Paraconsistent Logic
inferred← citeshttps://doi.org/10.1007/s11225-005-8473-8openalex-snapshot
A First Order Nonmonotonic Extension of Constructive Logic
inferred← citeshttps://doi.org/10.1007/s11225-005-8476-5openalex-snapshot
Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation
inferred← citeshttps://doi.org/10.1007/s11225-006-9004-yopenalex-snapshot
Non-Classical Negation in the Works of Helena Rasiowa and Their Impact on the Theory of Negation
inferred← citeshttps://doi.org/10.1023/a:1004222213212openalex-snapshot
On Extensions of Intermediate Logics by Strong Negation
inferred← citeshttps://doi.org/10.1023/b:stud.0000032104.14199.08openalex-snapshot
On the Representation of N4-Lattices
inferred← citeshttps://doi.org/10.1080/11663081.2023.2203312openalex-snapshot
Fragments of quasi-Nelson: residuation
inferred← citeshttps://doi.org/10.1093/jigpal/11.6.615openalex-snapshot
Kripke Completeness of First-Order Constructive Logics with Strong Negation
inferred← citeshttps://doi.org/10.1093/logcom/exn081openalex-snapshot
Constructive Logic with Strong Negation as a Substructural Logic
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.