Simple Programs Realize Exactly Presburger Formulas

DOI10.1137/0205045MaRDI QIDQ4124274zbMATH OpenOpenAlexFDO

Authors John C. Cherniavsky

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Proof theory and constructive mathematics (03F99)

Cited in

(4)

• Monadic logic programs and functional complexity
• Temporal specifications with accumulative values
• Simple programming languages and restricted classes of Turing machines
• A note on the complexity of program evaluation

This page was built for publication: Simple Programs Realize Exactly Presburger Formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124274)