Approaching arithmetic theories with finite-state automata

DOI10.1007/978-3-030-40608-0_3MaRDI QIDQ782555zbMATH OpenOpenAlexFDO

Authors Christoph Haase

Publication date 27 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-40608-0_3

zbMATH Keywords

automatic structuresBüchi arithmeticPresburger arithmeticreachability

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30)

Recommendations

• An effective decision procedure for linear arithmetic over the integers and reals
• scientific article; zbMATH DE number 2090515
• scientific article; zbMATH DE number 1765703
• Ehrenfeucht-Fraïssé goes automatic for real addition
• Ehrenfeucht-Fraïssé goes automatic for real addition

Cited in

(10)

• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
• On the complexity of linear arithmetic with divisibility
• scientific article; zbMATH DE number 2090515 (Why is no real title available?)
• Ehrenfeucht-Fraïssé goes automatic for real addition
• Analyzing restricted fragments of the theory of linear arithmetic
• An effective decision procedure for linear arithmetic over the integers and reals
• Computer Aided Verification
• Integer linear-exponential programming in NP by quantifier elimination
• Ehrenfeucht-Fraïssé goes automatic for real addition
• An introduction to the theory of linear integer arithmetic (invited paper)

This page was built for publication: Approaching arithmetic theories with finite-state automata

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