On the public citation graph

On finitely based consequence operations

https://doi.org/10.1007/bf02123410
0 signed · 18 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/bf02121212openalex-snapshot
Concerning the method of logical schemes, the notion of logical calculus and the role of consequence relations
inferredcites →https://doi.org/10.1007/bf02125225openalex-snapshot
A representation theorem for the lattice of standard consequence operations
inferredcites →https://doi.org/10.1007/bf02314419openalex-snapshot
Some theorems on structural consequence operations
inferredcites →https://doi.org/10.1016/s1385-7258(58)50024-9openalex-snapshot
Remarks on sentential logics
inferredcites →https://doi.org/10.18778/0138-0680openalex-snapshot
Bulletin of the Section of Logic

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.19870330214openalex-snapshot
A Formalisation, Using non‐Standard Rules, of A 5‐Valued Propositional Calculus
inferred← citeshttps://doi.org/10.1007/978-94-009-5203-4_2openalex-snapshot
Many-valued Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_4openalex-snapshot
Basic Many-Valued Logic
inferred← citeshttps://doi.org/10.1007/bf00370426openalex-snapshot
Key notions of Tarski's methodology of deductive systems
inferred← citeshttps://doi.org/10.1007/bf00372552openalex-snapshot
Remarks on a survey article on many valued logic by A. Urquhart
inferred← citeshttps://doi.org/10.1007/bf00373093openalex-snapshot
Finite structural axiomatization of every finite-valued propositional calculus
inferred← citeshttps://doi.org/10.1007/bf00713548openalex-snapshot
An example of strongly finite consequence operation with 2?0 standard strengthenings
inferred← citeshttps://doi.org/10.1007/bf01057933openalex-snapshot
Three-element nonfinitely axiomatizable matrices
inferred← citeshttps://doi.org/10.1007/bf01063844openalex-snapshot
The logic of algebraic rules as a generalization of equational logic
inferred← citeshttps://doi.org/10.1007/bf01874707openalex-snapshot
The lattice of strengthenings of a strongly finite consequence operation
inferred← citeshttps://doi.org/10.1007/bfb0099385openalex-snapshot
Remarks on finitely based logics
inferred← citeshttps://doi.org/10.18778/0208-6107.03.04openalex-snapshot
Zagadnienie stopni maksymalnoścl. (Przegląd)
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.