Sciweavers

148 search results - page 16 / 30
» apal 2007
Sort
View
97
Voted
APAL
1999
90views more  APAL 1999»
15 years 6 days ago
On Distinguishing Quotients of Symmetric Groups
A study is carried out of the elementary theory of quotients of symmetric groups in a similar spirit to [10]. Apart from the trivial and alternating subgroups, the normal subgroup...
Saharon Shelah, J. K. Truss
85
Voted
APAL
2002
56views more  APAL 2002»
15 years 12 days ago
Proof theory in the abstract
eory in the Abstract J. M. E. Hyland June 7, 2001 Dedicated to Anne Troelstra on the occasion of his 60th birthday: with great affection and respect, this small tribute to his infl...
J. M. E. Hyland
73
Voted
APAL
2007
83views more  APAL 2007»
15 years 20 days ago
On Feferman's operational set theory OST
We study OST and some of its most important extensions primarily from a proof-theoretic perspective, determine their consistency strengths by exhibiting equivalent systems in the ...
Gerhard Jäger
90
Voted
APAL
2007
72views more  APAL 2007»
15 years 20 days ago
On definable filters in computably enumerable degrees
Based on a result of Nies on definability the upper semilattice of computably enumerable degrees (denoted by R), we find that in R filters generated by definable subsets are al...
Wei Wang, Decheng Ding
84
Voted
APAL
2006
64views more  APAL 2006»
15 years 18 days ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký