1101 search results - page 70 / 221 » Forcing in proof theory |
131
click to vote
ELP
1991
15 years 4 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
95
Voted
CORR
2007
Springer
15 years 16 days ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
90
Voted
JASIS
2008
15 years 16 days ago
2008
: A recent article by Joseph Buschman regrets that democratic theory is an unfinished idea. The argument appears to assume an essential relationship between library information sci...
195
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
120
click to vote
ECRA
2007
15 years 15 days ago
2007
Information and communication technologies (ICTs) continue to have a profound effect on the economies and societies where they are used. In this article, we propose three related...