Sciweavers

13 search results - page 2 / 3
» Undecidability in Weihrauch Degrees
Sort
View
CIE
2007
Springer
14 years 5 months ago
A Useful Undecidable Theory
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 ...
Victor L. Selivanov
FUIN
2010
158views more  FUIN 2010»
13 years 8 months ago
Cellular Automata, Decidability and Phasespace
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...
Klaus Sutner
DBPL
1997
Springer
117views Database» more  DBPL 1997»
14 years 3 months ago
Degrees of Monotonicity of Spatial Transformations
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...
Bart Kuijpers
FORMATS
2008
Springer
14 years 12 days ago
MTL with Bounded Variability: Decidability and Complexity
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 ...
Carlo A. Furia, Matteo Rossi
APAL
1998
121views more  APAL 1998»
13 years 10 months ago
Computably Enumerable Sets and Quasi-Reducibility
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 ...
Rodney G. Downey, Geoffrey LaForte, André N...