13 search results - page 2 / 3 » Undecidability in Weihrauch Degrees |
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
FUIN
2010
13 years 2 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
DBPL
1997
Springer
13 years 9 months ago
1997
Springer
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...
FORMATS
2008
Springer
13 years 6 months ago
2008
Springer
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the ...
APAL
1998
13 years 5 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 ...