|
|
|
|
Lectures in Game Theory for Computer Scientists
Game playing is a powerful metaphor that fits many situations where interaction
between autonomous agents plays a central role. Numerous tasks
in computer science, such as design, synthesis, verification, testing, query
evaluation, planning, etc. can be formulated in game-theoretic terms. Viewing
them abstractly as games reveals the... | | Higher Recursion Theory (Perspectives in Mathematical Logic)
Hyperarithmetic theory is the first step beyond classical recursion theory. It is the primary source of ideas and examples in higher recursion theory. It is also a crossroad for several areas of mathematical logic: in set theory it is an initial segment of Godel's L; in model theory, the least admissible set after ; in descriptive set... | | Modal Logic: An Introduction to its Syntax and SemanticsIn this text, a variety of modal logics at the sentential, first-order, and second-order levels are developed with clarity, precision and philosophical insight. All of the S1-S5 modal logics of Lewis and Langford, among others, are constructed. A matrix, or many-valued semantics, for sentential modal logic is formalized, and an important result... |
|
|
|
|
|
Result Page: 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 |