This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular pattern languages. For the former, we mainly show that DNF formulas are pwm-reducible to CFGs that is sequential or that contains at most one nonterminal. For the latter, we show that both bounded finite unions of regu...

We show that any p-selective and self-reducible set is in P. As the converse is also true, we obtain a new characterization of the class P. A generalization and several consequences of this theorem are discussed. Among other consequences, we show that under reasonable assumptions auto-reducibility and self-reducibility diier on NP, and that there are non-p-T-mitotic sets in NP.

We propose >>-lifting as a technique for extending operational predicates to Moggi’s monadic computation types, independent of the choice of monad. We demonstrate the method with an application to Girard-Tait reducibility, using this to prove strong normalisation for the computational metalanguage λml . The particular challenge with reducibility is to apply this semantic notion at computation t...

We propose >>-lifting as a technique for extending operational predicates to Moggi’s monadic computation types, independent of the choice of monad. We demonstrate the method with an application to Girard-Tait reducibility, using this to prove strong normalisation for the computational metalanguage λml . The particular challenge with reducibility is to apply this semantic notion at computation t...

q-Deformed harmonic oscillator algebra for real and root of unity values of the deformation parameter is discussed by using an extension of the number concept proposed by Gauss, namely the Q-numbers. A study of the reducibility of the Fock space representation which explores the properties of the Gauss polynomials is presented. When the deformation parameter is a root of unity, an interesting r...