1055 search results - page 21 / 211 » Enumerations in computable structure theory |
Lecture Notes
These lecture notes cover several topics such as Topological Space, Metric Space, Convex Sets, Correspondences, Maximum Theorem, KKM Theorem, Existence of Maximal Element, Selectio...
ECIS
2003
13 years 11 months ago
2003
Co-ordination is seen as a fundamental aspect of organisational activity where computers can help. This is motivated by the need to reconcile the conflicts that arise from the div...
AML
2008
13 years 10 months ago
2008
The Major Sub-degree Problem of A. H. Lachlan (first posed in 1967) has become a long-standing open question concerning the structure of the computably enumerable (c.e.) degrees. ...
CIE
2007
Springer
14 years 4 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
BIRTHDAY
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...