On the public citation graph

LAR: A logic of algorithmic reasoning

https://doi.org/10.1007/bf00264469
0 signed · 42 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-07389-2_210openalex-snapshot
Formalization of algorithmic reasoning
inferredcites →https://doi.org/10.1007/978-3-642-88664-5openalex-snapshot
Vollständige Systeme modaler und intuitionistischer Logik
inferredcites →https://doi.org/10.1007/bf01705528openalex-snapshot
Algorithmic properties of structures
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50033-7openalex-snapshot
Some Philosophical Problems from the Standpoint of Artificial Intelligence
inferredcites →https://doi.org/10.1145/322047.322062openalex-snapshot
A New Incompleteness Result for Hoare's System
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.2307/2272694openalex-snapshot
A. Salwicki. Formalized algorithmic languages. English with English and Russian summaries. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 18 (1970), pp. 227–232, XVII, XVII. - A. Salwicki. On the equivalence of FS-expressions and…

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119420712.ch10openalex-snapshot
Model Checking
inferred← citeshttps://doi.org/10.1002/malq.19820281302openalex-snapshot
Eine Logik Erster Stufe mit Einem Infinitären Zeitoperator
inferred← citeshttps://doi.org/10.1002/malq.19840302602openalex-snapshot
VARIABLE TRUTH
inferred← citeshttps://doi.org/10.1002/malq.19870330506openalex-snapshot
Sequential Calculus for a First Order Infinitary Temporal Logic
inferred← citeshttps://doi.org/10.1002/malq.19880340503openalex-snapshot
Completeness Theorems for Temporal Logics TΩ and □TΩ
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_52openalex-snapshot
The connection between modal logic and algorithmic logics
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_11openalex-snapshot
A formal system for parallel programs in discrete time and space
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_21openalex-snapshot
A sequent calculus for Kröger logic
inferred← citeshttps://doi.org/10.1007/3-540-32743-6_14openalex-snapshot
Softwarequalität — Geschichte und Trends
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_10openalex-snapshot
Linear Temporal Logic and Finite Semigroups
inferred← citeshttps://doi.org/10.1007/3-540-45439-x_37openalex-snapshot
Design of UNIX System for the Prevention of Damage Propagation by Intrusion and Its Implementation Based on 4.4BSD
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_1openalex-snapshot
The Birth of Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-02734-5_5openalex-snapshot
Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf02465850openalex-snapshot
Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas
inferred← citeshttps://doi.org/10.1007/bf02737110openalex-snapshot
Program-substitution and admissibility of rules in algorithmic logic
inferred← citeshttps://doi.org/10.1007/bfb0022460openalex-snapshot
The temporal semantics of concurrent programs
inferred← citeshttps://doi.org/10.1007/bfb0023895openalex-snapshot
A sequent calculus for a first order linear temporal logic with equality
inferred← citeshttps://doi.org/10.1007/bfb0065340openalex-snapshot
Towards a nonstandard analysis of programs
inferred← citeshttps://doi.org/10.1007/s10958-005-0109-zopenalex-snapshot
Invertible infinitary calculus without loop rules for restricted FTL
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90051-4openalex-snapshot
A formal system for parallel programs in discrete time and space
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferred← citeshttps://doi.org/10.1016/j.apal.2011.12.002openalex-snapshot
Bounded linear-time temporal logic: A proof-theoretic investigation
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.06.002openalex-snapshot
Linear Temporal Logic Symbolic Model Checking
inferred← citeshttps://doi.org/10.1016/j.jal.2009.06.001openalex-snapshot
Combining linear-time temporal logic with constructiveness and paraconsistency
inferred← citeshttps://doi.org/10.1017/s0960129514000048openalex-snapshot
Embedding theorems for LTL and its variants
inferred← citeshttps://doi.org/10.1093/jigpal/jzq023openalex-snapshot
Phase semantics for linear-time formalism
inferred← citeshttps://doi.org/10.1145/1067915.1067920openalex-snapshot
Combining supervisor synthesis and model checking
inferred← citeshttps://doi.org/10.1145/3335772.3335780openalex-snapshot
Formal specification and verification
inferred← citeshttps://doi.org/10.1145/800017.800516openalex-snapshot
Temporal verification of carrier-sense local area network protocols
inferred← citeshttps://doi.org/10.12775/llp.2009.007openalex-snapshot
Temporal non-commutative logic: Expressing time, resource, order and hierarchy
inferred← citeshttps://doi.org/10.25335/m5jh3d441openalex-snapshot
Towards automated model revision for fault-tolerant systems
inferred← citeshttps://doi.org/10.4467/20842589rm.12.002.0683openalex-snapshot
Strong Normalization of a Typed Lambda Calculus for Intuitionistic Bounded Linear-time Temporal Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2109.08006openalex-snapshot
Deep Algorithmic Question Answering: Towards a Compositionally Hybrid AI for Algorithmic Reasoning
inferred← citeshttps://doi.org/10.5772/5319openalex-snapshot
A Linear Logic Based Approach to Timed Petri Nets
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.