On the public citation graph

A modal theory of arrows. Arrow logics I

https://doi.org/10.1007/bfb0023418
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/978-94-015-8242-1_8openalex-snapshot
Dyadic Modalities and Lambek Calculus
inferredcites →https://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferredcites →https://doi.org/10.1080/11663081.1991.10510769openalex-snapshot
Rough polyadic modal logics
inferredcites →https://doi.org/10.1090/s0002-9947-1982-0662049-7openalex-snapshot
Some Varieties Containing Relation Algebras
inferredcites →https://doi.org/10.2307/2274406openalex-snapshot
Johan van Benthem. Modal logic and classical logic. Indices, no. 3. Bibliopolis, Naples 1985 (©1983), also distributed by Humanities Press, Atlantic Highlands, N.J., 234 pp.
inferredcites →https://doi.org/10.2307/2372074openalex-snapshot
Boolean Algebras with Operators

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-61313-7_62openalex-snapshot
Geometrical structures and modal logic
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_146openalex-snapshot
A modal logic for data analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-97879-6_12openalex-snapshot
About the Complete Axiomatization of Dynamic Extensions of Arrow Logic
inferred← citeshttps://doi.org/10.1007/978-3-7908-1888-8_17openalex-snapshot
Axiomatization of Logics Based on Kripke Models with Relative Accessibility Relations
inferred← citeshttps://doi.org/10.1007/978-94-015-8879-9_6openalex-snapshot
Modal Logics of Arrows
inferred← citeshttps://doi.org/10.1007/s11225-012-9445-4openalex-snapshot
Complexity Results of STIT Fragments
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.007openalex-snapshot
Dynamic extensions of arrow logic
inferred← citeshttps://doi.org/10.1080/11663081.1996.10510890openalex-snapshot
Many-dimensional arrow logics
inferred← citeshttps://doi.org/10.1080/11663081.1999.10510971openalex-snapshot
Hyperboolean Algebras and Hyperboolean Modal Logic
inferred← citeshttps://doi.org/10.1080/11663081.2013.841359openalex-snapshot
Temporal logic and its application to normative reasoning
inferred← citeshttps://doi.org/10.3166/jancl.18.137-152openalex-snapshot
Hyper arrow logic with indiscernibility and complementarity
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.