Computer Science – Logic in Computer Science
Scientific paper
2005-12-02
LMCS 1 (3:3) 2005
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-1(3:3)2005
The almost periodic functions form a natural example of a non-separable
normed space. As such, it has been a challenge for constructive mathematicians
to find a natural treatment of them. Here we present a simple proof of Bohr's
fundamental theorem for almost periodic functions which we then generalize to
almost periodic functions on general topological groups.
No associations
LandOfFree
Almost periodic functions, constructively 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 Almost periodic functions, constructively, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost periodic functions, constructively will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-529469