1101 search results - page 75 / 221 » Forcing in proof theory |
137
click to vote
CSL
2008
Springer
15 years 5 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
114
Voted
AE
2005
Springer
15 years 9 months ago
2005
Springer
Ligation is a form of chemical self-assembly that involves dynamic formation of strong covalent bonds in the presence of weak associative forces. We study an extremely simple form ...
108
Voted
AISC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
121
click to vote
POPL
2010
ACM
16 years 27 days ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
134
Voted
TIT
2008
15 years 3 months ago
2008
Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distilla...