5 research outputs found
Decomposition of Decidable First-Order Logics over Integers and Reals
We tackle the issue of representing infinite sets of real- valued vectors.
This paper introduces an operator for combining integer and real sets. Using
this operator, we decompose three well-known logics extending Presburger with
reals. Our decomposition splits a logic into two parts : one integer, and one
decimal (i.e. on the interval [0,1]). We also give a basis for an
implementation of our representation
Decidability of definability issues in the theory of real addition
Given a subset of we can associate with every
point a vector space of maximal dimension with the
property that for some ball centered at , the subset coincides inside
the ball with a union of lines parallel with . A point is singular if
has dimension . In an earlier paper we proved that a -definable relation is actually definable in if and only if the number of singular points is finite and every rational
section of is -definable, where a rational section is
a set obtained from by fixing some component to a rational value. Here we
show that we can dispense with the hypothesis of being -definable by assuming that the components of the singular points
are rational numbers. This provides a topological characterization of
first-order definability in the structure . It also
allows us to deliver a self-definable criterion (in Muchnik's terminology) of
- and -definability for a
wide class of relations, which turns into an effective criterion provided that
the corresponding theory is decidable. In particular these results apply to the
class of recognizable relations on reals, and allow us to prove that it is
decidable whether a recognizable relation (of any arity) is
recognizable for every base .Comment: added sections 5 and 6, typos corrected. arXiv admin note: text
overlap with arXiv:2002.0428
Theories of real addition with and without a predicate for integers
We show that it is decidable whether or not a relation on the reals definable
in the structure can be defined
in the structure . This result is achieved
by obtaining a topological characterization of -definable relations in the family of -definable relations and then by following Muchnik's
approach of showing that the characterization of the relation can be
expressed in the logic of .
The above characterization allows us to prove that there is no intermediate
structure between and . We also show that a -definable relation is -definable if and only if its intersection with every -definable line is -definable. This gives a noneffective but simple characterization of
-definable relations