scientific article; zbMATH DE number 1827828
From MaRDI portal
Publication:4781602
zbMath1013.03071MaRDI QIDQ4781602
Publication date: 14 July 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveynumeration systemsdecidabilityfinite automatadefinabilityPresburger arithmeticSkolem arithmeticErdős-Woods conjecturefirst-order fragments of arithmeticFeferman-Vaught technique
Decidability (number-theoretic aspects) (11U05) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)
Related Items (14)
On the complexity of decision using destinies in \(H\)-bounded structures ⋮ Unnamed Item ⋮ An Ehrenfeucht-Fraïssé game approach to collapse results in database theory ⋮ A note on definability in fragments of arithmetic with free unary predicates ⋮ Circuit satisfiability and constraint satisfaction around Skolem arithmetic ⋮ Emptiness problems for integer circuits ⋮ Mini-workshop: Topological and differential expansions of o-minimal structures. Abstracts from the mini-workshop held November 27 -- December 3, 2022 ⋮ A wild model of linear arithmetic and discretely ordered modules ⋮ DECIDABILITY AND CLASSIFICATION OF THE THEORY OF INTEGERS WITH PRIMES ⋮ Weakly minimal groups with a new predicate ⋮ Cobham's theorem for substitutions ⋮ Iterated pushdown automata and sequences of rational numbers ⋮ INTERPRETING ARITHMETIC IN THE FIRST-ORDER THEORY OF ADDITION AND COPRIMALITY OF POLYNOMIAL RINGS ⋮ Emptiness Problems for Integer Circuits
This page was built for publication:
