70 search results - page 1 / 14 » An Undecidable Linear Order That Is n-Decidable for All n |
NDJFL
1998
13 years 4 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
LICS
2010
IEEE
13 years 2 months ago
2010
IEEE
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii)...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
ORDER
2002
13 years 4 months ago
2002
We show that: (1) For many regular cardinals (in particular, for all successors of singular strong limit cardinals, and for all successors of singular -limits), for all n {2, 3, ...
RT
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a method based on precomputed radiance transfer (PRT) that allows interactive rendering of glossy surfaces and includes shadowing effects from dynamic, “all-frequen...