528 search results - page 18 / 106 » Degrees of categoricity of computable structures |
ICTAC
2005
Springer
14 years 2 months ago
2005
Springer
Coalgebras provide effective models of data structures and state-transition systems. A virtual covariety is a class of coalgebras closed under coproducts, images of coalgebraic mo...
COLING
1990
13 years 9 months ago
1990
An experimental system for dialogue structure analysis based on a new type plan recognition model for spoken dialogues has been implemented. This model is realized by using four t...
CCA
2009
Springer
14 years 18 days ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
APAL
1998
13 years 8 months ago
1998
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
KER
2008
13 years 8 months ago
2008
Human categorization is neither a binary nor a context-free process. Rather, the criteria that govern the use and recognition of certain concepts may be satisfied to different deg...