1055 search results - page 94 / 211 » Enumerations in computable structure theory |
156
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
131
click to vote
CONCUR
2000
Springer
15 years 8 months ago
2000
Springer
This paper introduces process spaces, a unified theory of interacting systems. The trait, abstract executions, leads to a simple and general set formalism. For concurrent systems ...
123
click to vote
AAAI
2006
15 years 5 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
118
click to vote
ENTCS
2008
15 years 4 months ago
2008
: Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the ...