3145 search results - page 39 / 629 » Algebraic Linear Orderings |
189
click to vote
CONCUR
1992
Springer
15 years 10 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
266
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
166
click to vote
RTA
1997
Springer
15 years 10 months ago
1997
Springer
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
168
click to vote
CSL
2005
Springer
16 years 4 days ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
167
click to vote
ORDER
2006
15 years 6 months ago
2006
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...