On the public citation graph
Algorithmic aspects of propositional tense logics
0 signed · 21 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/bf02215288openalex-snapshot
Undecidable properties of extensions of a provability logic. II
inferredcites →https://doi.org/10.1016/0001-8708(77)90056-1openalex-snapshot
Finite equational bases for finite algebras in a congruence-distributive equational class
inferredcites →https://doi.org/10.1016/s0049-237x(08)70728-6openalex-snapshot
Completeness and Correspondence in the First and Second Order Semantics for Modal Logic
inferredcites →https://doi.org/10.1111/j.1755-2567.1970.tb00429.xopenalex-snapshot
Modal logics with linear alternative relations
inferredcites →https://doi.org/10.1111/j.1755-2567.1977.tb00788.xopenalex-snapshot
A finitely axiomatizable undecidable extension of K
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
inferredcites →https://doi.org/10.2307/2272895openalex-snapshot
Reduction of tense logic to modal logic. I
inferredcites →https://doi.org/10.2307/2275108openalex-snapshot
The undecidability of the disjunction property of propositional logics and other related problems
inferredcites →https://doi.org/10.4064/-9-1-341-345openalex-snapshot
Undecidability of the completeness problem of modal 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/978-3-319-69917-2_4openalex-snapshot
A Note on Strictly Positive Logics and Word Rewriting Systems
inferred← citeshttps://doi.org/10.1007/s10849-005-5788-9openalex-snapshot
Deciding Regular Grammar Logics with Converse Through First-Order Logic
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80010-3openalex-snapshot
7 Modal decision problems
inferred← citeshttps://doi.org/10.1017/s1755020322000132openalex-snapshot
TABULARITY AND POST-COMPLETENESS IN TENSE LOGIC
inferred← citeshttps://doi.org/10.1070/rm2012v067n04abeh004805openalex-snapshot
Squares of modal logics with additional connectives
inferred← citeshttps://doi.org/10.1070/rm9731openalex-snapshot
Bisimulation games and locally tabular logics
inferred← citeshttps://doi.org/10.1093/logcom/11.6.933openalex-snapshot
The Complexity of Regularity in Grammar Logics and Related Modal Logics
inferred← citeshttps://doi.org/10.1134/s0081543811060204openalex-snapshot
On squares of modal logics with additional connectives
inferred← citeshttps://doi.org/10.1142/9789812776471_0007openalex-snapshot
Modal Logics with Weak Forms of Recursion: PSPACE Specimens
inferred← citeshttps://doi.org/10.4213/rm9442openalex-snapshot
Квадраты модальных логик с дополнительными связками
inferred← citeshttps://doi.org/10.4213/rm9731openalex-snapshot
Бисимуляционные игры и локально табличные логики
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.