Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSeparating complexity classes using autoreducibility
58
0
0.0
(
0
)
Authors
Harry Buhrman
Ask ChatGPT about the research
No Arabic abstract
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all Turing-complete sets for certain levels of the exponential-time hierarchy are autoreducible but there exists some Turing-complete set for doubly exponential space that is not. Although we already knew how to separate these classes using diagonalization, our proofs separate classes solely by showing they have different structural properties, thus applying Posts Program to complexity theory. We feel such techniques may prove unknown separations in the future. In particular, if we could settle the question as to whether all Turing-complete sets for doubly exponential time are autoreducible, we would separate either polynomial time from polynomial space, and nondeterministic logarithmic space from nondeterministic polynomial time, or else the polynomial-time hierarchy from exponential time. We also look at the autoreducibility of complete sets under nonadaptive, bounded query, probabilistic and nonuniform reductions. We show how settling some of these autoreducibility questions will also read to new complexity class separations.
rate research
Read More
Henle, Mathias, and Woodin proved that, provided that $omegarightarrow(omega)^{omega}$ holds in a model $M$ of ZF, then forcing with $([omega]^{omega},subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a barren extension. Moreover, under an additional assumption, they proved that this generic extension preserves all strong partition cardinals. This forcing thus produces a model $M[mathcal{U}]$, where $mathcal{U}$ is a Ramsey ultrafilter, with many properties of the original model $M$. This begged the question of how important the Ramseyness of $mathcal{U}$ is for these results. In this paper, we show that several classes of $sigma$-closed forcings which generate non-Ramsey ultrafilters have the same properties. Such ultrafilters include Milliken-Taylor ultrafilters, a class of rapid p-points of Laflamme, $k$-arrow p-points of Baumgartner and Taylor, and extensions to a class of ultrafilters constructed by Dobrinen, Mijares and Trujillo. Furthermore, the class of Boolean algebras $mathcal{P}(omega^{alpha})/mathrm{Fin}^{otimes alpha}$, $2le alpha<omega_1$, forcing non-p-points also produce barren extensions.
We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies severa
We give effecti
For any pair of ordinals $alpha<beta$, $sf CA_alpha$ denotes the class of cylindric algebras of dimension $alpha$, $sf RCA_{alpha}$ denote the class of representable $sf CA_alpha$s and $sf Nr_alpha CA_beta$ ($sf Ra CA_beta)$ denotes the class of $alpha$-neat reducts (relation algebra reducts) of $sf CA_beta$. We show that any class $sf K$ such that $sf RaCA_omega subseteq sf Ksubseteq RaCA_5$, $sf K$ is not elementary, i.e not definable in first order logic. Let $2<n<omega$. It is also shown that any class $sf K$ such that $sf Nr_nCA_omega cap {sf CRCA}_nsubseteq {sf K}subseteq mathbf{S}_csf Nr_nCA_{n+3}$, where $sf CRCA_n$ is the class of completely representable $sf CA_n$s, and $mathbf{S}_c$ denotes the operation of forming complete subalgebras, is proved not to be elementary. Finally, we show that any class $sf K$ such that $mathbf{S}_dsf Ra CA_omega subseteq {sf K}subseteq mathbf{S}_csf RaCA_5$ is not elementary. It remains to be seen whether there exist elementary classes between $sf RaCA_omega$ and $mathbf{S}_dsf RCA_{omega}$. In particular, for $mgeq n+3$, the classes $sf Nr_nCA_m$, $sf CRCA_n$, $mathbf{S}_dsf Nr_nCA_m$, where $mathbf{S}_d$ is the operation of forming dense subalgebras are not first order definable.
This is a short introductory course to Set Theory, based on axioms of von Neumann--Bernays--Godel (briefly NBG). The text can be used as a base for a lecture course in Foundations of Mathematics, and contains a reasonable minimum which a good (post-graduate) student in Mathematics should know about foundations of this science.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
