On the public citation graph
Decidable and undecidable logics with a binary modality
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/978-1-4471-3227-1_3openalex-snapshot
Applying Algebraic Logic to Logic
inferredcites →https://doi.org/10.1007/978-1-4613-0897-3_17openalex-snapshot
Modal Environment for Boolean Speculations
inferredcites →https://doi.org/10.1007/bf00370557openalex-snapshot
Is ?some-other-time? sometimes better than ?sometime? for proving partial correctness of programs?
inferredcites →https://doi.org/10.1007/bf01578706openalex-snapshot
The ternary discriminator function in universal algebra
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7001-6openalex-snapshot
Cylindric Algebras Part II
inferredcites →https://doi.org/10.1090/s0002-9939-1987-0884476-5openalex-snapshot
Decidability of Relation Algebras with Weakened Associativity
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1093/jigpal/1.1.69openalex-snapshot
Translation Methods for Non-Classical Logics: An Overview
inferredcites →https://doi.org/10.1093/jigpal/1.1.91openalex-snapshot
Undecidable Varieties of Semilattice—ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus
inferredcites →https://doi.org/10.1093/jigpal/3.1.93openalex-snapshot
Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators
inferredcites →https://doi.org/10.2307/2274101openalex-snapshot
The word problem for cancellation semigroups with zero
inferredcites →https://doi.org/10.2307/2274537openalex-snapshot
Leon Henkin, J. Donald Monk, and Alfred Tarski. Cylindric algebras. Part II. Studies in logic and the foundations of mathematics, vol. 115. North-Holland, Amsterdam, New York, and Oxford, 1985, ix + 302 pp.
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4064/cm-30-1-15-25openalex-snapshot
The join of equational theories
inferredcites →https://doi.org/10.7551/mitpress/4286.003.0004openalex-snapshot
A Note on Dynamic Arrow 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/3-540-44802-0_22openalex-snapshot
Labelled Natural Deduction for Interval Logics
inferred← citeshttps://doi.org/10.1007/978-3-030-02149-8_6openalex-snapshot
Decidability of Equational Theories for Subsignatures of Relation Algebra
inferred← citeshttps://doi.org/10.1007/978-3-030-38808-9_9openalex-snapshot
Iterative Division in the Distributive Full Non-associative Lambek Calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-63787-3_1openalex-snapshot
Lambek Calculus with Classical Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-76920-8_5openalex-snapshot
An Algebraic Glimpse at Bunched Implications and Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-57635-5_5openalex-snapshot
Relational Patterns, Partiality, and Set Lifting in Modal Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_37openalex-snapshot
Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_26openalex-snapshot
Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-3-319-57418-9_9openalex-snapshot
Relation Algebras, Idempotent Semirings and Generalized Bunched Implication Algebras
inferred← citeshttps://doi.org/10.1007/978-3-319-65430-0_6openalex-snapshot
Categorial Grammars and Their Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-22119-4_17openalex-snapshot
Cut Elimination for Shallow Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-662-60292-8_20openalex-snapshot
First Degree Entailment with Group Attitudes and Information Updates
inferred← citeshttps://doi.org/10.1007/s00153-024-00921-wopenalex-snapshot
On undecidability of the propositional logic of an associative binary modality
inferred← citeshttps://doi.org/10.1007/s00153-026-01025-3openalex-snapshot
Intuitionistic logic of a binary modality
inferred← citeshttps://doi.org/10.1007/s10849-008-9070-9openalex-snapshot
Developing Bounded Reasoning
inferred← citeshttps://doi.org/10.1007/s10992-026-09830-0openalex-snapshot
Towards a Quantum Logic of Paradox
inferred← citeshttps://doi.org/10.1093/logcom/exz018openalex-snapshot
A logic of hypothetical conjunction
inferred← citeshttps://doi.org/10.1109/lics.2010.24openalex-snapshot
Undecidability of Propositional Separation Logic and Its Neighbours
inferred← citeshttps://doi.org/10.1145/2542667openalex-snapshot
Undecidability of Propositional Separation Logic and Its Neighbours
inferred← citeshttps://doi.org/10.25560/18059openalex-snapshot
Sequent Calculi with Context Restrictions and Applications to Conditional Logic
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.