On the public citation graph

Logical matrices and non-structural consequence operators

https://doi.org/10.1007/bf01418757
0 signed · 17 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.1007/bf02123806openalex-snapshot
Matrix approach in methodology of sentential calculi
inferredcites →https://doi.org/10.1016/s1385-7258(58)50024-9openalex-snapshot
Remarks on sentential logics
inferredcites →https://doi.org/10.2307/2272465openalex-snapshot
Deducibility and many-valuedness
inferredcites →https://doi.org/10.2307/2272897openalex-snapshot
Note on deducibility and many-valuedness
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-032-11027-5_9openalex-snapshot
Restricted Swap Structures for C-Systems: An Algebraic and Categorical Approach
inferred← citeshttps://doi.org/10.1007/bf00247910openalex-snapshot
Two theorems on many-valued logics
inferred← citeshttps://doi.org/10.1007/bf00274067openalex-snapshot
Many-valued computational logics
inferred← citeshttps://doi.org/10.1007/bf01049473openalex-snapshot
Nonmonotonic theories and their axiomatic varieties
inferred← citeshttps://doi.org/10.1007/s11225-021-09972-zopenalex-snapshot
Two Decision Procedures for da Costa’s $$C_n$$ Logics Based on Restricted Nmatrix Semantics
inferred← citeshttps://doi.org/10.1017/s1755020325100737openalex-snapshot
RNMATRICES FOR MODAL LOGICS
inferred← citeshttps://doi.org/10.1093/logcom/exae045openalex-snapshot
A Gödel-Dugundji-style theorem for the minimal structural logic
inferred← citeshttps://doi.org/10.1109/ismvl.1989.37812openalex-snapshot
Many-valued computational logics
inferred← citeshttps://doi.org/10.12775/llp.2022.027openalex-snapshot
From Inconsistency to Incompatibility
inferred← citeshttps://doi.org/10.4204/eptcs.449.11openalex-snapshot
Efficient Decision Procedures for RNmatrix Semantics
inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1244055openalex-snapshot
Multialgebras and non-deterministic semantics applied to paraconsistent logics
inferred← citeshttps://doi.org/10.48550/arxiv.2011.10151openalex-snapshot
A simple decision procedure for da Costa's Cn logics by Restricted Nmatrix semantics
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.