Equational theories of profinite structures

Details Equational theories of profinite structures Equational theories of profinite structures

2011-11-02

arxiv.org/abs/1111.0476v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family of recognisable sets is a lattice if and only if it is definable by a family of profinite equations. This result extends Theorem 5.2 from [GGEP08] expressed only for finite words and morphisms to finite monoids. One of the applications of our theorem is the situation where objects are finite relational structures and recognisers are first order sentences. In that setting a simple characterisation of lattices of first order formulas arise.

Affiliated with

Also associated with

No associations

Rating

Equational theories of profinite structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Equational theories of profinite structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equational theories of profinite structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-328158