On the public citation graph

Connections between some notions of completeness of structural propositional calculi

0 signed · 15 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s1385-7258(58)50024-9openalex-snapshot
Remarks on sentential logics
inferredcites →https://doi.org/10.4064/fm-68-3-269-279openalex-snapshot
Some remarks on the consequence operation in sentential logics

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-40220-8_8openalex-snapshot
From Paraconsistent Logic to Dialetheic Logic
inferred← citeshttps://doi.org/10.1007/978-94-015-8273-5_14openalex-snapshot
A Minimal Implicational Logic
inferred← citeshttps://doi.org/10.1007/bf00370426openalex-snapshot
Key notions of Tarski's methodology of deductive systems
inferred← citeshttps://doi.org/10.1007/bf01874707openalex-snapshot
The lattice of strengthenings of a strongly finite consequence operation
inferred← citeshttps://doi.org/10.1007/bf02120868openalex-snapshot
Concerning the notion of completeness of invariant propositional calculi
inferred← citeshttps://doi.org/10.1017/s1755020318000308openalex-snapshot
ON CONTRA-CLASSICAL VARIANTS OF NELSON LOGIC N4 AND ITS CLASSICAL EXTENSION
inferred← citeshttps://doi.org/10.1093/analys/anad106openalex-snapshot
Fragility and strength
inferred← citeshttps://doi.org/10.1134/s0001434621110249openalex-snapshot
Theories of the Classical Propositional Logic and Substitutions
inferred← citeshttps://doi.org/10.18778/0208-6107.03.04openalex-snapshot
Zagadnienie stopni maksymalnoścl. (Przegląd)
inferred← citeshttps://doi.org/10.21146/2074-1472-2023-29-2-59-88openalex-snapshot
On the three-valued expansions of Kleene's logic
inferred← citeshttps://doi.org/10.21146/2074-1472-2024-30-2-44-71openalex-snapshot
Three-valued generalizations of classical logic in weak languages: the degree of maximality
inferred← citeshttps://doi.org/10.4204/eptcs.415.20openalex-snapshot
A note on Grigoriev and Zaitsev's system CNL^2_4
inferred← citeshttps://doi.org/10.4213/mzm12469openalex-snapshot
Теории классической пропозициональной логики и подстановка
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.