✦ LIBER ✦

On the categoricity of semigroup-theoretical properties

✍ Scribed by Burrow P. Brooks; W. Edwin Clark

Book ID: 110560187
Publisher: Springer
Year: 1971
Tongue: English
Weight: 282 KB
Volume: 3
Category: Article
ISSN: 0037-1912
DOI: 10.1007/bf02572963

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On 0-homology of categorical at zero sem

On 0-homology of categorical at zero semigroups

✍ Novikov, Boris ;Polyakova, Lyudmyla 📂 Article 📅 2009 🏛 Walter de Gruyter GmbH 🌐 English ⚖ 553 KB

On some categorical properties of the fu

On some categorical properties of the functor UR

✍ Yuri V. Sadovnichy 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 126 KB

We deal with the unit ball U R (X) of non-negative Radon measures on a Tychonoff space X. U R is a functor in the category Tych. It is proved that U R has all properties of a normal functor, with the exception of point preservation.

Model theoretic aspects of the ellis sem

Model theoretic aspects of the ellis semigroup

✍ Ludomir Newelski 📂 Article 📅 2011 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 336 KB

Operator theoretic properties of differe

Operator theoretic properties of differences of semigroups in terms of their generators

✍ S. Blunck; L. Weis 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 242 KB

Reversibility properties of semigroup ac

Reversibility properties of semigroup actions on homogeneous spaces

✍ Reis, Ronan A.; Martin, Luiz A. B. 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 552 KB

On the complexity of categoricity in com

On the complexity of categoricity in computable structures

✍ Walker M. White 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract We investigate the computational complexity the class of Γ‐categorical computable structures. We show that hyperarithmetic categoricity is Π^1^~1~‐complete, while computable categoricity is Π^0^~4~‐hard. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)