On the public citation graph
Modal logic with names
0 signed · 169 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/3-540-51803-7_28openalex-snapshot
Specifying message passing systems requires extending temporal logic
inferredcites →https://doi.org/10.1007/3-540-56283-4openalex-snapshot
Specifying Message Passing and Time-Critical Systems with Temporal Logic
inferredcites →https://doi.org/10.1007/978-1-4613-0609-2_21openalex-snapshot
A Note on Boolean Modal 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/978-94-009-8384-7_3openalex-snapshot
An Irreflexivity Lemma with Applications to Axiomatizations of Conditions on Tense Frames
inferredcites →https://doi.org/10.1016/0304-3975(88)90126-0openalex-snapshot
Determinism and looping in combinatory PDL
inferredcites →https://doi.org/10.1016/0890-5401(91)90026-xopenalex-snapshot
An essay in combinatory dynamic logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)70723-7openalex-snapshot
Some Connections Between Elementary and Modal Logic
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.1017/s0004972700041186openalex-snapshot
Metamathematics of modal logic
inferredcites →https://doi.org/10.1093/logcom/1.2.229openalex-snapshot
An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
inferredcites →https://doi.org/10.1093/logcom/2.1.5openalex-snapshot
Using the Universal Modality: Gains and Questions
inferredcites →https://doi.org/10.1109/tse.1978.231499openalex-snapshot
The Logic of Computer Programming
inferredcites →https://doi.org/10.1111/j.1755-2567.1961.tb00020.xopenalex-snapshot
Modality and Quantification
inferredcites →https://doi.org/10.1111/j.1755-2567.1970.tb00428.xopenalex-snapshot
An approach to tense logic1
inferredcites →https://doi.org/10.1305/ndjfl/1093635335openalex-snapshot
Modal definability in enriched languages.
inferredcites →https://doi.org/10.1305/ndjfl/1093870149openalex-snapshot
Axioms for tense logic. I. ``Since'' and ``until''.
inferredcites →https://doi.org/10.1305/ndjfl/1093894226openalex-snapshot
Some embedding theorems for modal logic.
inferredcites →https://doi.org/10.2307/2273696openalex-snapshot
Canonical modal logics and ultrafilter extensions
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11964810_6openalex-snapshot
Relational Approach to Order-of-Magnitude Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_15openalex-snapshot
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_16openalex-snapshot
Cut-Free Display Calculi for Nominal Tense Logics
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_24openalex-snapshot
Tableau Calculi for Hybrid Logics
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_19openalex-snapshot
Relative Similarity Logics are Decidable: Reduction to FO2 with Equality
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_12openalex-snapshot
A simple tableau system for the logic of elsewhere
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_495openalex-snapshot
Social Networks and Granular Computing
inferred← citeshttps://doi.org/10.1007/978-1-0716-2628-3_495openalex-snapshot
Social Networks and Granular Computing
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_183openalex-snapshot
Social Networks and Granular Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_47openalex-snapshot
Reasoning About Cognitive Attitudes in a Qualitative Setting
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_25openalex-snapshot
Operational Semantics and Program Verification Using Many-Sorted Hybrid Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_5openalex-snapshot
Tense Logics over Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-39784-4_22openalex-snapshot
Decidability of Modal Logics of Non-k-Colorable Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_48openalex-snapshot
Hybrid Modal Operators for Definite Descriptions
inferred← citeshttps://doi.org/10.1007/978-3-031-91361-7_9openalex-snapshot
The Hide and Seek Game: Perspectives from Hybrid Logic
inferred← citeshttps://doi.org/10.1007/978-3-032-04590-4_17openalex-snapshot
On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order
inferred← citeshttps://doi.org/10.1007/978-3-032-22469-9_14openalex-snapshot
Hybrid Many-Sorted Modal Logic with Nominal Terms
inferred← citeshttps://doi.org/10.1007/978-3-032-22626-6_2openalex-snapshot
Hybrid Logics with Moving Names
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_10openalex-snapshot
Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_18openalex-snapshot
Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse
inferred← citeshttps://doi.org/10.1007/978-3-642-22119-4_16openalex-snapshot
Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_34openalex-snapshot
A Universally Defined Undecidable Unimodal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_495-5openalex-snapshot
Social Networks and Granular Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_495-6openalex-snapshot
Social Networks and Granular Computing
inferred← citeshttps://doi.org/10.1007/978-3-662-47709-0_11openalex-snapshot
Characterizing Frame Definability in Team Semantics via the Universal Modality
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_24openalex-snapshot
Characterizing Relative Frame Definability in Team Semantics via the Universal Modality
inferred← citeshttps://doi.org/10.1007/978-3-662-58771-3_2openalex-snapshot
Propositional Modal Logic with Implicit Modal Quantification
inferred← citeshttps://doi.org/10.1007/978-94-007-0002-4_1openalex-snapshot
Introduction to Hybrid Logic
inferred← citeshttps://doi.org/10.1007/978-94-007-0002-4_5openalex-snapshot
Functional Completeness for a Hybrid Logic
inferred← citeshttps://doi.org/10.1007/978-94-007-1344-4_5openalex-snapshot
Entanglement of Preference, Knowledge and Belief
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_4openalex-snapshot
Discipline as Logic: Treating Labels as First Class Citizens
inferred← citeshttps://doi.org/10.1007/978-94-015-8879-9_5openalex-snapshot
The Logic of Correct Description
inferred← citeshttps://doi.org/10.1007/978-94-017-3524-7_3openalex-snapshot
Aligning Logical and Psychological Perspectives on Diagrammatic Reasoning
inferred← citeshttps://doi.org/10.1007/978-94-017-8860-1_11openalex-snapshot
Derivational Modal Logics with the Difference Modality
inferred← citeshttps://doi.org/10.1007/978-981-15-1342-8_6openalex-snapshot
Algebraic Semantics for Hybrid Logics
inferred← citeshttps://doi.org/10.1007/978-981-15-7134-3_9openalex-snapshot
Modal Logic and Planarity of Graphs
inferred← citeshttps://doi.org/10.1007/bf00173700openalex-snapshot
Eliminating “converse” from converse PDL
inferred← citeshttps://doi.org/10.1007/bf00215625openalex-snapshot
Hierarchies of modal and temporal logics with reference pointers
inferred← citeshttps://doi.org/10.1007/bf01050635openalex-snapshot
A modal perspective on the computational complexity of attribute value grammar
inferred← citeshttps://doi.org/10.1007/bf01530788openalex-snapshot
Towards reasoning about Hoare relations
inferred← citeshttps://doi.org/10.1007/bfb0013985openalex-snapshot
Temporal logic with reference pointers
inferred← citeshttps://doi.org/10.1007/s10472-012-9316-8openalex-snapshot
Global view on reactivity: switch graphs and their logics
inferred← citeshttps://doi.org/10.1007/s10849-009-9087-8openalex-snapshot
Terminating Tableau Systems for Hybrid Logic with Difference and Converse
inferred← citeshttps://doi.org/10.1007/s10849-009-9091-zopenalex-snapshot
Hybrid Logics of Separation Axioms
inferred← citeshttps://doi.org/10.1007/s10992-009-9122-xopenalex-snapshot
Temporal Reference in Linear Tense Logic
inferred← citeshttps://doi.org/10.1007/s10992-012-9260-4openalex-snapshot
Completeness in Hybrid Type Theory
inferred← citeshttps://doi.org/10.1007/s11225-005-3704-6openalex-snapshot
Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere
inferred← citeshttps://doi.org/10.1007/s11225-006-9009-6openalex-snapshot
Pure Extensions, Proof Rules, and Hybrid Axiomatics
inferred← citeshttps://doi.org/10.1007/s11225-007-9023-3openalex-snapshot
Notes on Logics of Metric Spaces
inferred← citeshttps://doi.org/10.1007/s11225-016-9680-1openalex-snapshot
On the Modal Logic of Subset and Superset: Tense Logic over Medvedev Frames
inferred← citeshttps://doi.org/10.1007/s11225-018-9784-xopenalex-snapshot
The Monodic Fragment of Propositional Term Modal Logic
inferred← citeshttps://doi.org/10.1007/s11225-024-10149-7openalex-snapshot
Hybrid Logic of the Hide and Seek Game
inferred← citeshttps://doi.org/10.1007/s11229-009-9644-3openalex-snapshot
A dynamic-epistemic hybrid logic for intentions and information changes in strategic games
inferred← citeshttps://doi.org/10.1007/s11229-015-0920-0openalex-snapshot
Reichenbach, Prior and hybrid tense logic
inferred← citeshttps://doi.org/10.1016/j.apal.2005.10.005openalex-snapshot
Elementary canonical formulae: extending Sahlqvist’s theorem
inferred← citeshttps://doi.org/10.1016/j.apal.2008.11.001openalex-snapshot
Modal languages for topology: Expressivity and definability
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.009openalex-snapshot
Characterising modal definability of team-based logics via the universal modality
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102786openalex-snapshot
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations
inferred← citeshttps://doi.org/10.1016/j.apal.2022.103165openalex-snapshot
Computational complexity of hybrid interval temporal logics
inferred← citeshttps://doi.org/10.1016/j.artint.2004.04.012openalex-snapshot
On the undecidability of logics with converse, nominals, recursion and counting
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.11.028openalex-snapshot
A Hybridization of Irreflexive Modal Logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.027openalex-snapshot
Terminating Tableau Calculi for Hybrid Logics Extending K
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.035openalex-snapshot
Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.039openalex-snapshot
Hybrid Tableaux for the Difference Modality
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.06.012openalex-snapshot
Axiomatizing Hybrid Products of Monotone Neighborhood Frames
inferred← citeshttps://doi.org/10.1016/j.jal.2007.06.008openalex-snapshot
The many faces of counts-as: A formal analysis of constitutive rules
inferred← citeshttps://doi.org/10.1016/j.jal.2010.08.006openalex-snapshot
Axiomatizing hybrid products
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100644openalex-snapshot
Many-sorted hybrid modal languages
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80011-5openalex-snapshot
8 Modal consequence relations
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.006openalex-snapshot
Algebras and General Frames
inferred← citeshttps://doi.org/10.1017/s1471068421000053openalex-snapshot
A Qualitative Theory of Cognitive Attitudes and their Change
inferred← citeshttps://doi.org/10.1017/s1755020317000259openalex-snapshot
COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
inferred← citeshttps://doi.org/10.1017/s1755020322000120openalex-snapshot
TAMING THE ‘ELSEWHERE’: ON EXPRESSIVITY OF TOPOLOGICAL LANGUAGES
inferred← citeshttps://doi.org/10.1023/a:1004359325754openalex-snapshot
Combinations of Tense and Modality for Predicate Logic
inferred← citeshttps://doi.org/10.1023/a:1004900300438openalex-snapshot
Simulation and Transfer Results in Modal Logic – A Survey
inferred← citeshttps://doi.org/10.1023/a:1005021313747openalex-snapshot
Axiomatizations with Context Rules of Inference in Modal Logic
inferred← citeshttps://doi.org/10.1023/a:1005081328928openalex-snapshot
Characterizations of Negative Definability in Modal Logic
inferred← citeshttps://doi.org/10.1023/a:1005235713913openalex-snapshot
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I
inferred← citeshttps://doi.org/10.1023/a:1005260600511openalex-snapshot
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II
inferred← citeshttps://doi.org/10.1023/a:1006617525134openalex-snapshot
Aligning Logical and Psychological Perspectives on Diagrammatic Reasoning
inferred← citeshttps://doi.org/10.1023/a:1008271805106openalex-snapshot
An Equational Axiomatization of Dynamic Negation and Relational Composition
inferred← citeshttps://doi.org/10.1023/a:1008398102653openalex-snapshot
An Extended Branching-Time Ockhamist Temporal Logic
inferred← citeshttps://doi.org/10.1023/a:1010358017657openalex-snapshot
Modal Logic As Dialogical Logic
inferred← citeshttps://doi.org/10.1023/a:1015726824270openalex-snapshot
Remarks on Gregory's “Actually” Operator
inferred← citeshttps://doi.org/10.1023/a:1018988913388openalex-snapshot
Hybridizing concept languages
inferred← citeshttps://doi.org/10.1080/11663081.1999.10510971openalex-snapshot
Hyperboolean Algebras and Hyperboolean Modal Logic
inferred← citeshttps://doi.org/10.1080/11663081.1999.10510982openalex-snapshot
Inequality without irreflexivity
inferred← citeshttps://doi.org/10.1080/11663081.2000.10510998openalex-snapshot
Temporal Logics with Reference Pointers and Computation Tree Logics
inferred← citeshttps://doi.org/10.1093/jigpal/6.1.73openalex-snapshot
Products of modal logics, part 1
inferred← citeshttps://doi.org/10.1093/jigpal/8.3.339openalex-snapshot
Representation, reasoning, and relational structures: a hybrid logic manifesto
inferred← citeshttps://doi.org/10.1093/jigpal/jzab029openalex-snapshot
Algorithmic correspondence for hybrid logic with binder
inferred← citeshttps://doi.org/10.1093/jigpal/jzac079openalex-snapshot
Sahlqvist completeness theory for hybrid logic with downarrow binder
inferred← citeshttps://doi.org/10.1093/jigpal/jzi024openalex-snapshot
Hybrid logics with Sahlqvist axioms
inferred← citeshttps://doi.org/10.1093/jigpal/jzy039openalex-snapshot
Analogues of Bull’s theorem for hybrid logic
inferred← citeshttps://doi.org/10.1093/logcom/11.5.737openalex-snapshot
Sahlqvist Formulas in Hybrid Polyadic Modal Logics
inferred← citeshttps://doi.org/10.1093/logcom/12.6.993openalex-snapshot
Display Calculi for Nominal Tense Logics
inferred← citeshttps://doi.org/10.1093/logcom/exac105openalex-snapshot
Modal structures in groups and vector spaces
inferred← citeshttps://doi.org/10.1093/logcom/exi056openalex-snapshot
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
inferred← citeshttps://doi.org/10.1093/logcom/exl026openalex-snapshot
Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
inferred← citeshttps://doi.org/10.1093/logcom/exv045openalex-snapshot
On Sahlqvist theory for hybrid logics
inferred← citeshttps://doi.org/10.1109/lics.2002.1029843openalex-snapshot
Description logics: foundations for class-based knowledge representation
inferred← citeshttps://doi.org/10.1142/9789812799746_0005openalex-snapshot
Global Definability in Basic Modal Logic
inferred← citeshttps://doi.org/10.1145/3358499.3361221openalex-snapshot
Modal assertions for actor correctness
inferred← citeshttps://doi.org/10.1145/3763134openalex-snapshot
Modal Abstractions for Virtualizing Memory Addresses
inferred← citeshttps://doi.org/10.1145/3764860.3768337openalex-snapshot
Modal Verification Patterns for Systems Software
inferred← citeshttps://doi.org/10.12775/llp.2016.004openalex-snapshot
Simple cut elimination proof for hybrid logic
inferred← citeshttps://doi.org/10.1305/ndjfl/1179323264openalex-snapshot
Semantical Characterizations for Irreflexive and Generalized Modal Languages
inferred← citeshttps://doi.org/10.2168/lmcs-2(1:5)2006openalex-snapshot
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
inferred← citeshttps://doi.org/10.2168/lmcs-2(2:5)2006openalex-snapshot
Modal Logics of Topological Relations
inferred← citeshttps://doi.org/10.2178/jsl/1107298517openalex-snapshot
Interpolation for extended modal languages
inferred← citeshttps://doi.org/10.22028/d291-26295openalex-snapshot
Incremental decision procedures for modal logics with nominals and eventualities
inferred← citeshttps://doi.org/10.2307/2275109openalex-snapshot
Derivation rules as anti-axioms in modal logic
inferred← citeshttps://doi.org/10.2307/2586754openalex-snapshot
Normal monomodal logics can simulate all others
inferred← citeshttps://doi.org/10.2307/2695090openalex-snapshot
Hybrid logics: characterization, interpolation and complexity
inferred← citeshttps://doi.org/10.3166/jancl.12.365-397openalex-snapshot
Modal Logics for Parallelism, Orthogonality, and Affine Geometries
inferred← citeshttps://doi.org/10.3166/jancl.14.9-54openalex-snapshot
A Road Map of Interval Temporal Logics and Duration Calculi
inferred← citeshttps://doi.org/10.3166/jancl.18.175-211openalex-snapshot
IV. Semantic extensions of SQEMA
inferred← citeshttps://doi.org/10.4204/eptcs.303.2openalex-snapshot
From Hybrid Modal Logic to Matching Logic and Back
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0845openalex-snapshot
A Simplest Undecidable Modal Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2102.13291openalex-snapshot
Algorithmic Correspondence for Hybrid Logic with Binder
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0106031openalex-snapshot
Complexity Results and Practical Algorithms for Logics in Knowledge Representation
inferred← citeshttps://doi.org/10.48550/arxiv.math/0610357openalex-snapshot
Modal languages for topology: expressivity and definability
inferred← citeshttps://doi.org/10.70675/3a23b5f9z537cz4dd0z9fd8z42fe13aeb3abopenalex-snapshot
Reasoning Tasks for Hybrid Logics
inferred← citeshttps://doi.org/10.70675/abf28f43zb1f0z424ez9b04z4a5c5373c177openalex-snapshot
Logics for Social Networks : Asynchronous Announcements in Orthogonal Structures
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.