scientific article; zbMATH DE number 3575557
From MaRDI portal
Publication:4147966
zbMath0369.02023MaRDI QIDQ4147966
Publication date: 1977
Full work available at URL: https://eudml.org/doc/61616
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) Hierarchies of computability and definability (03D55)
Related Items (8)
Decidability of Definability Issues in the Theory of Real Addition ⋮ Multi-dimensional sets recognizable in all abstract numeration systems ⋮ Quantitative estimates for the size of an intersection of sparse automatic sets ⋮ The definable criterion for definability in Presburger arithmetic and its applications. ⋮ An asymptotic version of Cobham’s theorem ⋮ A multi-dimensional analogue of Cobham’s theorem for fractals ⋮ An analogue of Cobham’s theorem for fractals ⋮ Substitutive systems and a finitary version of Cobham's theorem
This page was built for publication:
