On the public citation graph

Matrix representations for structural strengthenings of a propositional logic

https://doi.org/10.1007/bf00405384
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/bf02120495openalex-snapshot
The logics stronger than Łukasiewicz's three valued sentential calculus-the notion of degree of maximality versus the notion of degree of completeness
inferredcites →https://doi.org/10.1007/bf02121267openalex-snapshot
Degrees of maximality of Klukasiewicz-like sentential calculi
inferredcites →https://doi.org/10.1007/bf02123409openalex-snapshot
A strongly finite logic with infinite degree of maximality
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.1090/s0002-9904-1944-08235-9openalex-snapshot
Subdirect unions in universal algebra

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19910370907openalex-snapshot
Common Logic of 2‐Valued Semigroup Connectives
inferred← citeshttps://doi.org/10.1007/978-1-4899-0548-2_1openalex-snapshot
Consequence Relations of 2-element Algebras
inferred← citeshttps://doi.org/10.1007/978-3-031-44461-6_18openalex-snapshot
An Essay in Matrix Semantics for Consequence Relations
inferred← citeshttps://doi.org/10.1007/bf00370510openalex-snapshot
On the degree of complexity of sentential logics.II. An example of the logic with semi-negation
inferred← citeshttps://doi.org/10.1007/bf00373095openalex-snapshot
Reduced products of logical matrices
inferred← citeshttps://doi.org/10.1007/bf00401653openalex-snapshot
2-Element matrices
inferred← citeshttps://doi.org/10.1007/bf01874707openalex-snapshot
The lattice of strengthenings of a strongly finite consequence operation
inferred← citeshttps://doi.org/10.1093/jigpal/jzv024openalex-snapshot
Almost structurally complete infinitary consequence operations extending S4.3
inferred← citeshttps://doi.org/10.1215/00294527-3636512openalex-snapshot
Modal Consequence Relations Extending S4.3: An Application of Projective Unification
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
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.