On the public citation graph
An Avron rule for fragments of R-mingle
0 signed · 43 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/bf01982031openalex-snapshot
A criterion for admissibility of rules in the model system S4 and the intuitionistic logic
inferredcites →https://doi.org/10.1007/bf02120824openalex-snapshot
On the structural completeness of some pure implicational propositional calculi
inferredcites →https://doi.org/10.1007/bf02123821openalex-snapshot
Proof of structural completeness of a certain class of implicative propositional calculi
inferredcites →https://doi.org/10.1007/s00500-012-0839-zopenalex-snapshot
Admissibility in De Morgan algebras
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50001-0openalex-snapshot
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
inferredcites →https://doi.org/10.1016/j.apal.2008.10.011openalex-snapshot
Proof theory for admissible rules
inferredcites →https://doi.org/10.1016/j.apal.2010.09.001openalex-snapshot
Admissible rules in the implication–negation fragment of intuitionistic logic
inferredcites →https://doi.org/10.1016/j.apal.2011.06.004openalex-snapshot
Unification in linear temporal logic LTL
inferredcites →https://doi.org/10.1016/j.jpaa.2015.02.015openalex-snapshot
Admissibility via natural dualities
inferredcites →https://doi.org/10.1016/s0049-237x(97)x8001-2openalex-snapshot
Admissibility of Logical Inference Rules
inferredcites →https://doi.org/10.1016/s0168-0072(99)00032-9openalex-snapshot
Best solving modal equations
inferredcites →https://doi.org/10.1017/s0022481200092161openalex-snapshot
Algebraic completeness results for R-mingle and its extensions
inferredcites →https://doi.org/10.1090/s0002-9947-07-04235-3openalex-snapshot
Representable idempotent commutative residuated lattices
inferredcites →https://doi.org/10.1093/jigpal/5.2.181openalex-snapshot
Multiplicative Conjunction as an Extensional Conjunction
inferredcites →https://doi.org/10.1093/jigpal/jzn014openalex-snapshot
Structural Completeness in Substructural Logics
inferredcites →https://doi.org/10.1093/logcom/exi029openalex-snapshot
Admissible Rules of Modal Logics
inferredcites →https://doi.org/10.1093/logcom/exp078openalex-snapshot
Admissible Rules of Lukasiewicz Logic
inferredcites →https://doi.org/10.1093/logcom/exp082openalex-snapshot
Bases of Admissible Rules of Lukasiewicz Logic
inferredcites →https://doi.org/10.1093/logcom/exq020openalex-snapshot
Linear Temporal Logic LTL: Basis for Admissible Rules
inferredcites →https://doi.org/10.1215/00294527-2009-004openalex-snapshot
Structural Completeness in Fuzzy Logics
inferredcites →https://doi.org/10.1305/ndjfl/1093634487openalex-snapshot
A structurally complete fragment of relevant logic.
inferredcites →https://doi.org/10.1305/ndjfl/1093636612openalex-snapshot
On an implication connective of ${\rm RM}$.
inferredcites →https://doi.org/10.1305/ndjfl/1107220674openalex-snapshot
Intermediate Logics and Visser's Rules
inferredcites →https://doi.org/10.2168/lmcs-9(1:9)2013openalex-snapshot
Generalizing determinization from automata to coalgebras
inferredcites →https://doi.org/10.2168/lmcs-9(2:9)2013openalex-snapshot
Admissibility in Finitely Generated Quasivarieties
inferredcites →https://doi.org/10.2307/2586570openalex-snapshot
Implicational F-structures and implicational relevance logics
inferredcites →https://doi.org/10.2307/2694922openalex-snapshot
On the admissible rules of intuitionistic propositional logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11225-017-9766-4openalex-snapshot
Finitary Extensions of the Nilpotent Minimum Logic and (Almost) Structural Completeness
inferred← citeshttps://doi.org/10.1016/j.apal.2016.03.002openalex-snapshot
Almost structural completeness; an algebraic approach
inferred← citeshttps://doi.org/10.1016/j.jpaa.2019.106228openalex-snapshot
Sugihara algebras: Admissibility algebras via the test spaces method
inferred← citeshttps://doi.org/10.1145/3275115openalex-snapshot
Checking Admissibility Using Natural Dualities
inferred← citeshttps://doi.org/10.1155/2022/4805035openalex-snapshot
Research on Security Anomaly Detection for Big Data Platforms Based on Quantum Optimization Clustering
inferred← citeshttps://doi.org/10.1515/ms-2017-0327openalex-snapshot
Sugihara algebras and Sugihara monoids: Multisorted dualities
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:23)2015openalex-snapshot
Exact Unification and Admissibility
inferred← citeshttps://doi.org/10.2168/lmcs-9(2:9)2013openalex-snapshot
Admissibility in Finitely Generated Quasivarieties
inferred← citeshttps://doi.org/10.48550/arxiv.1901.09533openalex-snapshot
Sugihara algebras and monoids: multisorted dualities
inferred← citeshttps://doi.org/10.48550/arxiv.2002.06560openalex-snapshot
Piggybacking over unbounded distributive lattices
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.