528 search results - page 20 / 106 » Degrees of categoricity of computable structures |
JANCL
2008
13 years 8 months ago
2008
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
GG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Adhesive high-level replacement (HLR) categories and systems are introduced as a new categorical framework for graph transformation in a broad sense, which combines the w...
JSYML
2007
13 years 8 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
WISEC
2009
ACM
14 years 3 months ago
2009
ACM
Mobile ad-hoc networks are becoming ever more popular due to their flexibility, low cost, and ease of deployment. However, to achieve these benefits the network must employ a so...
TLCA
2009
Springer
14 years 3 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...