Login / Signup
Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems.
Christian Michaux
Roger Villemaire
Published in:
Ann. Pure Appl. Log. (1996)
Keyphrases
</>
presburger arithmetic
decision procedures
quantifier elimination
theorem proving
sequent calculus
theorem prover
cellular automata
modal logic
description logics
constraint satisfaction
inference rules
algebraic structure