On the public citation graph
Is ?some-other-time? sometimes better than ?sometime? for proving partial correctness of programs?
0 signed · 46 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.1002/malq.19840303102openalex-snapshot
STRUCTURED NONSTANDARD DYNAMIC LOGIC
inferredcites →https://doi.org/10.1007/3-540-11981-7_1openalex-snapshot
Sharpening the characterization of the power of Floyd method
inferredcites →https://doi.org/10.1007/3-540-15648-8_24openalex-snapshot
The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods
inferredcites →https://doi.org/10.1016/0022-0000(87)90003-1openalex-snapshot
Expressive completeness failure in branching time structures
inferredcites →https://doi.org/10.1016/0304-3975(81)90076-1openalex-snapshot
Programs and program verifications in a general setting
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(82)90004-4openalex-snapshot
A complete logic for reasoning about programs via nonstandard model theory I
inferredcites →https://doi.org/10.1016/0304-3975(85)90024-6openalex-snapshot
A simple proof for the completeness of Floyd's method
inferredcites →https://doi.org/10.1016/0304-3975(87)90118-6openalex-snapshot
Total correctness in nonstandard logics of programs
inferredcites →https://doi.org/10.1016/0304-3975(89)90138-2openalex-snapshot
The power of temporal proofs
inferredcites →https://doi.org/10.1016/0304-3975(89)90156-4openalex-snapshot
Weak second order characterizations of various program verification systems
inferredcites →https://doi.org/10.1016/0304-3975(89)90165-5openalex-snapshot
Hoare's logic for nondeterministic regular programs: A nonstandard approach
inferredcites →https://doi.org/10.1016/0890-5401(89)90055-2openalex-snapshot
Definability with bounded number of bound variables
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.
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-52753-2_48openalex-snapshot
A streamlined temporal completeness theorem
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_3openalex-snapshot
Applying Algebraic Logic to Logic
inferred← citeshttps://doi.org/10.1007/bf01049412openalex-snapshot
Decidable and undecidable logics with a binary modality
inferred← citeshttps://doi.org/10.1007/bfb0040269openalex-snapshot
Does “N+1 times” prove more programs correct than “N times”?
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90148-7openalex-snapshot
Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.05.003openalex-snapshot
A logical study of group-size based social network creation
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/12.6.993openalex-snapshot
Display Calculi for Nominal Tense Logics
inferred← citeshttps://doi.org/10.13130/bianchetti-matteo_phd2011-05-11openalex-snapshot
LE MOLTE VERSIONI DELLA CONSEGUENZA LOGICA
inferred← citeshttps://doi.org/10.18778/0138-0680.2023.09openalex-snapshot
The Modelwise Interpolation Property of Semantic Logics
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.54310/elpis.2022.1.8openalex-snapshot
Megjegyzések a lokális Craig interpolációhoz
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.