220 search results - page 39 / 44 » Saturated models of universal theories |
AO
2007
13 years 7 months ago
2007
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
EATCS
2000
13 years 7 months ago
2000
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
CTCS
1989
Springer
13 years 11 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
SIGMETRICS
2006
ACM
14 years 1 months ago
2006
ACM
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...