On the public citation graph
The logic MPLω
0 signed · 30 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-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1007/bf01470747openalex-snapshot
Der Interpolationssatz der intuitionistischen Prädikatenlogik
inferredcites →https://doi.org/10.1007/bf02429843openalex-snapshot
Descriptions in mathematical logic
inferredcites →https://doi.org/10.1007/bfb0061839openalex-snapshot
Identity and existence in intuitionistic logic
inferredcites →https://doi.org/10.1007/bfb0079093openalex-snapshot
Proceedings of the Summer School in Logic Leeds, 1967
inferredcites →https://doi.org/10.1007/bfb0079679openalex-snapshot
The Syntax and Semantics of Infinitary Languages
inferredcites →https://doi.org/10.1007/bfb0079691openalex-snapshot
Normal derivability in classical logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7021-1openalex-snapshot
Languages with Expressions of Infinite Length
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7034-xopenalex-snapshot
Model Theory For Infinitary Logic
inferredcites →https://doi.org/10.2307/2271770openalex-snapshot
Existence and Description in Formal Logic.
inferredcites →https://doi.org/10.2307/2314842openalex-snapshot
Languages with Expressions of Infinite Length.
inferredcites →https://doi.org/10.4064/fm-57-3-253-272openalex-snapshot
An interpolation theorem for denumerably long formulas
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-53912-3_19openalex-snapshot
Experiences with combining formalisms in VVSL
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_18openalex-snapshot
LPF and MPLω — A logical comparison of VDM SL and COLD-K
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_26openalex-snapshot
Upgrading the pre- and postcondition technique
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_17openalex-snapshot
From Implicit via Inductive to Explicit Definitions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_19openalex-snapshot
Reasoning about Dynamic Features in Specification Languages
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_2openalex-snapshot
An Overview of the Development of COLD
inferred← citeshttps://doi.org/10.1007/bf01178666openalex-snapshot
A typed logic of partial functions reconstructed classically
inferred← citeshttps://doi.org/10.1007/bf01214955openalex-snapshot
Modular structuring of VDM specifications in VVSL
inferred← citeshttps://doi.org/10.1007/bfb0014423openalex-snapshot
Algebraic specification languages: An overview
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00003-4openalex-snapshot
Mechanisms for naming An algebraic approach with an application to Java
inferred← citeshttps://doi.org/10.1016/s0169-023x(98)00047-0openalex-snapshot
Modal Change Logic (MCL): Specifying the reasoning of knowledge-based systems
inferred← citeshttps://doi.org/10.1049/sej.1992.0022openalex-snapshot
Specification of interfering programs based on interconditions
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.