3954 search results - page 219 / 791 » Image-based Model Completion |
150
click to vote
APAL
2010
15 years 6 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
153
click to vote
APAL
2006
15 years 6 months ago
2006
BLE CATEGORICITY OF LOCAL ABSTRACT ELEMENTARY CLASSES WITH AMALGAMATION JOHN T. BALDWIN AND OLIVIER LESSMANN We give a complete and elementary proof of the following upward categor...
142
click to vote
EOR
2008
15 years 6 months ago
2008
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
175
click to vote
IIE
2006
15 years 6 months ago
2006
The paper describes some possible ways how to improve Olympiads in Informatics. Tasks in Olympiads are small models of programming tasks in software industry and in the limited amo...
146
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...