On the public citation graph

The Recursive Resolution method for Modal Logic

https://doi.org/10.1007/bf03037397
0 signed · 14 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.1109/tc.1976.1674704openalex-snapshot
Methods for Automated Theorem Proving in Nonclassical Logics
inferredcites →https://doi.org/10.1111/j.1468-0149.1969.tb00005.xopenalex-snapshot
AN INTRODUCTION TO MODAL LOGIC
inferredcites →https://doi.org/10.1145/321160.321166openalex-snapshot
Theorem-Proving on the Computer
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-52335-9_55openalex-snapshot
Gentzen-type systems and resolution rules part I propositional logic
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_46openalex-snapshot
New ways for developing proof theories for first-order multi modal logics
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_18openalex-snapshot
Resolution Calculi for Non-normal Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_6openalex-snapshot
Non-iterative Modal Resolution Calculi
inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_8openalex-snapshot
Using Otter for Temporal Resolution
inferred← citeshttps://doi.org/10.1007/bf01058389openalex-snapshot
A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics
inferred← citeshttps://doi.org/10.1007/bfb0012852openalex-snapshot
A resolution calculus for modal logics
inferred← citeshttps://doi.org/10.1016/0950-7051(88)90004-4openalex-snapshot
Recursive modal unification for reasoning with knowledge using a graph representation
inferred← citeshttps://doi.org/10.1016/s0747-7171(10)80002-1openalex-snapshot
A resolution framework for finitely-valued first-order logics
inferred← citeshttps://doi.org/10.1093/logcom/8.3.345openalex-snapshot
Resolution for temporal logics of knowledge
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.