APAL
2011
12 years 11 months ago
2011
We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we d...
JUCS
2010
13 years 3 months ago
2010
: We investigate the problem of decomposing a language into a catenation of nontrivial languages, none of which can be decomposed further. In many cases this leads to the operation...
MST
2007
13 years 4 months ago
2007
We construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1...