148 search results - page 10 / 30 » apal 2007 |
APAL
1998
15 years 7 days ago
1998
We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
109
Voted
APAL
1999
15 years 6 days ago
1999
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and s...
77
Voted
APAL
2007
15 years 20 days ago
2007
We show that ℵ2 ≤ b < g is consistent. This work is dedicated to James Baumgartner on the occasion of his 60th birthday.
64
Voted
APAL
2007
15 years 20 days ago
2007
We prove that, if V is an effectively given commutative valuation domain such that its value group is dense and archimedean, then the theory of all V -modules is decidable.
110
click to vote
APAL
2006
15 years 18 days ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...