15 search results - page 1 / 3 » The Core of a Countably Categorical Structure |
65
Voted
STACS
2005
Springer
15 years 4 months ago
2005
Springer
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
80
Voted
MLQ
2010
14 years 9 months ago
2010
Abstract. In this paper, we give a classification of (finite or countable) ℵ0categorical coloured linear orders, generalizing Rosenstein’s characterization of ℵ0-categorica...
106
click to vote
CSL
2003
Springer
15 years 3 months ago
2003
Springer
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
APAL
2008
14 years 10 months ago
2008
There exists a countable structure M of Scott rank CK 1 where M 1 = CK 1 and where the LCK 1 ,-theory of M is not -categorical. The Scott rank of a model is the least ordinal whe...
71
Voted
ENTCS
2002
14 years 10 months ago
2002
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...