Definably complete structures are not pseudo-enumerable

Archive for Mathematical Logic 2011 / 07 Vol. 50; Iss. 5-6

Definably complete structures are not pseudo-enumerable

Antongiulio Fornasiero
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
50
Language:
english
Pages:
13
DOI:
10.1007/s00153-011-0235-x
Date:
July, 2011
File:
PDF, 188 KB
english, 2011
Conversion to is in progress
Conversion to is failed