On the public citation graph
Simple Programs Realize Exactly Presburger Formulas
0 signed · 26 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/bf02246433openalex-snapshot
Function iteration logics and flowchart schemata
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1145/321707.321721openalex-snapshot
Subrecursive Programming Languages, Part I
inferredcites →https://doi.org/10.2307/1970573openalex-snapshot
The Elementary Theory of Finite Fields
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-57287-2_44openalex-snapshot
Regular languages and a class of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57287-2_45openalex-snapshot
Some results on the complexity of SLD-derivations
inferred← citeshttps://doi.org/10.1007/bf01744435openalex-snapshot
A note on the complexity of program evaluation
inferred← citeshttps://doi.org/10.1007/bfb0030314openalex-snapshot
The equivalence problem and correctness formulas for a simple class of programs
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90085-3openalex-snapshot
Simple programming languages and restricted classes of turing machines
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80018-8openalex-snapshot
The equivalence problem and correctness formulas for a simple class of programs
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80019-xopenalex-snapshot
On simple programs with primitive conditional statements
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00093-xopenalex-snapshot
Monadic logic programs and functional complexity
inferred← citeshttps://doi.org/10.1109/sfcs.1977.2openalex-snapshot
A new decidable problem, with applications
inferred← citeshttps://doi.org/10.1137/0210003openalex-snapshot
Characterizations of Presburger Functions
inferred← citeshttps://doi.org/10.1137/0215059openalex-snapshot
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze
inferred← citeshttps://doi.org/10.1145/2629686openalex-snapshot
Temporal Specifications with Accumulative Values
inferred← citeshttps://doi.org/10.1145/3149.3157openalex-snapshot
Decidable problems for powerful programs
inferred← citeshttps://doi.org/10.1145/322108.322120openalex-snapshot
A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
inferred← citeshttps://doi.org/10.1145/322169.322185openalex-snapshot
Verification Decidability of Presburger Array Programs
inferred← citeshttps://doi.org/10.1145/322261.322270openalex-snapshot
The Complexity of the Equivalence Problem for Simple Programs
inferred← citeshttps://doi.org/10.1145/502175.502181openalex-snapshot
On the fundamental limitations of transformational design
inferred← citeshttps://doi.org/10.1145/512950.512951openalex-snapshot
A complete and consistent hoare axiomatics for a simple programming language
inferred← citeshttps://doi.org/10.1145/567446.567452openalex-snapshot
Analysis of simple programs over different sets of primitives
inferred← citeshttps://doi.org/10.1145/800135.804407openalex-snapshot
The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs
inferred← citeshttps://doi.org/10.1145/800141.804680openalex-snapshot
Space-time tradeoffs and first order problems in a model of programs
inferred← citeshttps://doi.org/10.48550/arxiv.2104.01667openalex-snapshot
A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory
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.