Simple Programs Realize Exactly Presburger Formulas
From MaRDI portal
Publication:4124274
DOI10.1137/0205045zbMath0353.68018OpenAlexW1978995933MaRDI QIDQ4124274
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205045
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Proof theory and constructive mathematics (03F99)
Related Items (4)
Temporal Specifications with Accumulative Values ⋮ Monadic logic programs and functional complexity ⋮ A note on the complexity of program evaluation ⋮ Simple programming languages and restricted classes of Turing machines
This page was built for publication: Simple Programs Realize Exactly Presburger Formulas