On the public citation graph
Decidability and the finite model property
0 signed · 52 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.1016/s0049-237x(08)70724-9openalex-snapshot
Filtrations and the Finite Frame Property in Boolean Semantics
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7035-1openalex-snapshot
Proceedings of the Third Scandinavian Logic Symposium
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-1-4020-8590-1_1openalex-snapshot
Modal logic and standard logic
inferred← citeshttps://doi.org/10.1007/978-1-4020-8590-1_2openalex-snapshot
The syntax of normal modal systems
inferred← citeshttps://doi.org/10.1007/978-1-4020-8590-1_3openalex-snapshot
The semantics of normal modal systems
inferred← citeshttps://doi.org/10.1007/978-1-4020-8590-1_4openalex-snapshot
Completeness and canonicity
inferred← citeshttps://doi.org/10.1007/978-1-4020-8590-1_5openalex-snapshot
Incompleteness and finite models
inferred← citeshttps://doi.org/10.1007/978-1-4020-8590-1_7openalex-snapshot
Epistemic logic: knowledge and belief
inferred← citeshttps://doi.org/10.1007/978-1-4020-8590-1_9openalex-snapshot
Towards quantified modal logic
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_11openalex-snapshot
Modal Logics of Some Hereditarily Irresolvable Spaces
inferred← citeshttps://doi.org/10.1007/978-3-031-29415-0_3openalex-snapshot
Modern Faces of Filtration
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_7openalex-snapshot
Effective Finite-Valued Approximations of General Propositional Logics
inferred← citeshttps://doi.org/10.1007/bf00249364openalex-snapshot
The decidable normal modal logics are not recursively enumerable
inferred← citeshttps://doi.org/10.1007/bf00250541openalex-snapshot
A solution to a problem of urquhart
inferred← citeshttps://doi.org/10.1007/bf01053022openalex-snapshot
Decidability by filtrations for graded normal logics (graded modalities V)
inferred← citeshttps://doi.org/10.1007/s10992-007-9062-2openalex-snapshot
SYNONYMOUS LOGICS: A CORRECTION
inferred← citeshttps://doi.org/10.1007/s11225-020-09901-6openalex-snapshot
Pooling Modalities and Pointwise Intersection: Axiomatization and Decidability
inferred← citeshttps://doi.org/10.1007/s11225-023-10093-yopenalex-snapshot
Variations on the Kripke Trick
inferred← citeshttps://doi.org/10.1007/s11225-024-10134-0openalex-snapshot
Decidability of Inquisitive Modal Logic via Filtrations
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80004-8openalex-snapshot
1 Modal logic: a semantic perspective
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00008-9openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80027-0openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.006openalex-snapshot
Algebras and General Frames
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.007openalex-snapshot
Computability and Complexity
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.012openalex-snapshot
A Guide to the Literature
inferred← citeshttps://doi.org/10.1093/logcom/exac085openalex-snapshot
Complexity function and complexity of validity of modal and superintuitionistic propositional logics
inferred← citeshttps://doi.org/10.1093/logcom/exq022openalex-snapshot
Preservation by fibring of the finite model property
inferred← citeshttps://doi.org/10.1109/ismvl.1994.302193openalex-snapshot
Approximating propositional calculi by finite-valued logics
inferred← citeshttps://doi.org/10.1109/lics.2017.8005073openalex-snapshot
Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries
inferred← citeshttps://doi.org/10.11575/prism/38803openalex-snapshot
Proof Theory of Finite-valued Logics
inferred← citeshttps://doi.org/10.4204/eptcs.335.12openalex-snapshot
No Finite Model Property for Logics of Quantified Announcements
inferred← citeshttps://doi.org/10.4324/9780203016244openalex-snapshot
An Introduction to Substructural Logics
inferred← citeshttps://doi.org/10.48550/arxiv.0707.3205openalex-snapshot
Neutrality and Many-Valued Logics
inferred← citeshttps://doi.org/10.5555/3329995.3330008openalex-snapshot
Herbrand property, finite quasi-herbrand models, and a chandra-merlin theorem for quantified conjunctive queries
inferred← citeshttps://doi.org/10.70675/2228deb4z405fz47f1zbb57z9e9fa6e644d1openalex-snapshot
Practical resolution of satisfiability testing for modal logics
inferred← citeshttps://doi.org/10.70675/6a415ed3z09a7z4be9zb69ez54453f1311a0openalex-snapshot
Propriété du domaine borné pour la logique temporelle linéaire du premier ordre et applications à la vérification de systèmes à états infinis
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.