Results 1 
6 of
6
Logic and precognizable sets of integers
 Bull. Belg. Math. Soc
, 1994
"... We survey the properties of sets of integers recognizable by automata when they are written in pary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to N m due to Semenov. We detail the remarkable proof recently given ..."
Abstract

Cited by 68 (4 self)
 Add to MetaCart
We survey the properties of sets of integers recognizable by automata when they are written in pary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to N m due to Semenov. We detail the remarkable proof recently given by Muchnik for the theorem of CobhamSemenov, the original proof being published in Russian. 1
Definable Relations and FirstOrder Query Languages over Strings
"... We study analogs of classical relational calculus in the context of strings. We start by studying string logics. Taking a classical modeltheoretic approach, we fix a set of string operations and look at the resulting collection of definable relations. These form an algebra  a class of nary relati ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
We study analogs of classical relational calculus in the context of strings. We start by studying string logics. Taking a classical modeltheoretic approach, we fix a set of string operations and look at the resulting collection of definable relations. These form an algebra  a class of nary relations for every n, closed under projection and Boolean operations. We show that by choosing the string vocabulary carefully, we get string logics that have desirable properties: computable evaluation and normal forms. We identify five distinct models and study the differences in their modeltheory and complexity of evaluation. We identify a subset of these models which have additional attractive properties, such as finite VC dimension and quantifier elimination. Once you have a logic,
A ModelTheoretic Approach to Regular String Relations
, 2001
"... We study algebras of de nable string relations  classes of regular nary relations that arise as the definable sets within a model whose carrier is the set of all strings. We show that the largest such algebra  the collection of regular relations  has some quite undesirable computational and mode ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
We study algebras of de nable string relations  classes of regular nary relations that arise as the definable sets within a model whose carrier is the set of all strings. We show that the largest such algebra  the collection of regular relations  has some quite undesirable computational and modeltheoretic properties. In contrast, we exhibit several definable relation algebras that have much tamer behavior: for example, they admit quantifier elimination, and have finite VC dimension. We show that the properties of a definable relation algebra are not at all determined by the onedimensional definable sets. We give models whose definable sets are all starfree, but whose binary relations are quite complex, as well as models whose definable sets include all regular sets, but which are much more restricted and tractable than the full algebra of regular relations.
A Survey of Arithmetical Definability
, 2002
"... We survey definability and decidability issues related to firstorder fragments of arithmetic, with a special emphasis on Presburger and Skolem arithmetic and their (un)decidable extensions. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We survey definability and decidability issues related to firstorder fragments of arithmetic, with a special emphasis on Presburger and Skolem arithmetic and their (un)decidable extensions.
ON THE EXPANSION (N, +, 2 x) OF PRESBURGER ARITHMETIC FRANÇOISE POINT 1
"... This is based on a preprint ([9]) which appeared in the Proceedings of the fourth ..."
Abstract
 Add to MetaCart
This is based on a preprint ([9]) which appeared in the Proceedings of the fourth