On the bounded quasi‐degrees of c.e. sets

We study the degree structure of bQ‐reducibility and we prove that for any noncomputable c.e. incomplete bQ‐degree a, there exists a nonspeedable bQ‐degree incomparable with it. The structure $\mathcal {D}_{\mbox{bs}}$ of the $\mbox{bs}$‐degrees is not elementary equivalent neither to the structure of the $\mbox{be}$‐degrees nor to the structure of the $\mbox{e}$‐degrees. If c.e. degrees a and b form a minimal pair in the c.e. bQ‐degrees, then a and b form a minimal pair in the bQ‐degrees. Also, for every simple set S there is a noncomputable nonspeedable set A which is bQ‐incomparable with S and bQ‐degrees of S and A does not form a minimal pair.     

Truth‐table Schnorr randomness and truth‐table reducible randomness

Schnorr randomness and computable randomness are natural concepts of random sequences. However van Lambalgen’s Theorem fails for both randomnesses. In this paper we define truth‐table Schnorr randomness (defined in 6 too only by martingales) and truth‐table reducible randomness, for which we prove that van Lambalgen's Theorem holds. We also show that the classes of truth‐table Schnorr random reals relative to a high set contain reals Turing equivalent to the high set. It follows that each high Schnorr random real is half of a real for which van Lambalgen's Theorem fails. Moreover we establish the coincidence between triviality and lowness notions for truth‐table Schnorr randomness. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Quantifier‐eliminable locally finite graphs

We identify the locally finite graphs that are quantifier‐eliminable and their first order theories in the signature of distance predicates. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

A note on parameter free Π1‐induction and restricted exponentiation

We characterize the sets of all Π₂ and all $\mathcal {B}(\Sigma _{1})We characterize the sets of all Π₂ and all $\mathcal {B}(\Sigma _{1})$ (= Boolean combinations of Σ₁) theorems of IΠ^?₁ in terms of restricted exponentiation, and use these characterizations to prove that both sets are not deductively equivalent. We also discuss how these results generalize to n > 0. As an application, we prove that a conservation theorem of Beklemishev stating that IΠ^?_{n + 1} is conservative over IΣ^?_n with respect to $\mathcal {B}(\Sigma _{n+1})$ sentences cannot be extended to Π_{n + 2} sentences. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Global existence of solutions to a magnetohydrodynamic‐omega model

In this paper, some sufficient conditions in terms of the magnetic field are established to guarantee global existence of solutions to a magnetohydrodynamic‐omega model.     

On quasi‐varieties of multiple valued logic models

We extend the concept of quasi‐variety of first‐order models from classical logic to multiple valued logic (MVL) and study the relationship between quasi‐varieties and existence of initial models in MVL. We define a concept of ‘Horn sentence’ in MVL and based upon our study of quasi‐varieties of MVL models we derive the existence of initial models for MVL ‘Horn theories’. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Reductions between types of numberings

This paper considers reductions between types of numberings; these reductions preserve the Rogers Semilattice of the numberings reduced and also preserve the number of minimal and positive degrees in their semilattice. It is shown how to use these reductions to simplify some constructions of specific semilattices. Furthermore, it is shown that for the basic types of numberings, one can reduce the left-r.e. numberings to the r.e. numberings and the k-r.e. numberings to the $(k+1)$-r.e. numberings; all further reductions are obtained by concatenating these reductions.     

Binary types in ℵ0‐categorical weakly o‐minimal theories

Orthogonality of all families of pairwise weakly orthogonal 1‐types for ?₀‐categorical weakly o‐minimal theories of finite convexity rank has been proved in 6 . Here we prove orthogonality of all such families for binary 1‐types in an arbitrary ?₀‐categorical weakly o‐minimal theory and give an extended criterion for binarity of ?₀‐categorical weakly o‐minimal theories (additionally in terms of binarity of 1‐types). © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

The Cauchy‐Kowalewski product for bicomplex holomorphic functions

In this paper we study the Cauchy‐Kowalewski extension of real analytic functions satisfying a system of differential equations connected to bicomplex analysis, and we use this extension to study the product in the space of bicomplex holomorphic functions. We also show how these ideas can be used to define a Fourier transform for bicomplex holomorphic functions.     

Nisan‐Wigderson generators in proof systems with forms of interpolation

We prove that the Nisan‐Wigderson generators based on computationally hard functions and suitable matrices are hard for propositional proof systems that admit feasible interpolation. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

On definability of types of finite Cantor‐Bendixson rank

We prove that every type of finite Cantor‐Bendixson rank over a model of a first‐order theory without the strict order property is definable and has a unique nonforking extension to a global type. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

De Morgan Heyting algebras satisfying the identity xn(′*) ≈ x(n+1)(′*)

In this paper we investigate the sequence of subvarieties $ {\mathcal {SDH}_n} $of De Morgan Heyting algebras characterized by the identity x^n(′*) ≈ x^(n+1)(′*). We obtain necessary and sufficient conditions for a De Morgan Heyting algebra to be in $ {\mathcal {SDH}_1} $ by means of its space of prime filters, and we characterize subdirectly irreducible and simple algebras in $ {\mathcal {SDH}_1} $. We extend these results for finite algebras in the general case $ {\mathcal {SDH}_n} $. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Rice and Rice‐Shapiro Theorems for transfinite correction grammars

Hay and, then, Johnson extended the classic Rice and Rice‐Shapiro Theorems for computably enumerable sets, to analogs for all the higher levels in the finite Ershov Hierarchy. The present paper extends their work (with some motivations presented) to analogs in the transfinite Ershov Hierarchy. Some of the transfinite cases are done for all transfinite notations in Kleene's important system of notations, $\mathcal {O}$. Other cases are done for all transfinite notations in a very natural, proper subsystem $\mathcal {O}_{\mathrm{Cantor}}$ of $\mathcal {O}$, where $\mathcal {O}_{\mathrm{Cantor}}$ has at least one notation for each constructive ordinal. In these latter cases it is open as to what happens for the entire set of transfinite notations in $(\mathcal {O} -\mathcal {O}_{\mathrm{Cantor}})$.     

Cell decomposition and definable functions for weak p‐adic structures

We develop a notion of cell decomposition suitable for studying weak p‐adic structures (reducts of p‐adic fields where addition and multiplication are not (everywhere) definable). As an example, we consider a structure with restricted addition.     

Results on value distribution of L‐functions

We will establish a theorem concerning value distribution of L‐functions in the Selberg class, which shows how an L‐function and a meromorphic function are uniquely determined by their c‐values and which, as a consequence, proves a result on the uniqueness of the Riemann zeta function. The results in this paper also extend the corresponding ones in Li 6 .     

Non‐well‐founded extensions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbf {V}$\end{document}

This paper describes a new and user‐friendly method for constructing models of non‐well‐founded set theory. Given a sufficiently well‐behaved system θ of non‐well‐founded set‐theoretic equations, we describe how to construct a model M_θ for $\mathsf {ZFC}^-$ in which θ has a non‐degenerate solution. We shall prove that this M_θ is the smallest model for $\mathsf {ZFC}^-$ which contains $\mathbf {V}$ and has a non‐degenerate solution of θ.     

Radical of filters in BL‐algebras

In this paper, the notion of the radical of a filter in BL‐algebras is defined and several characterizations of the radical of a filter are given. Also we prove that A/F is an MV‐algebra if and only if D_s(A) ? F. After that we define the notion of semi maximal filter in BL‐algebras and we state and prove some theorems which determine the relationship between this notion and the other types of filters of a BL‐algebra. Moreover, we prove that A/F is a semi simple BL‐algebra if and only if F is a semi maximal filter of A. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Fuzzy closure systems on L—ordered sets

In this paper, notions of fuzzy closure system and fuzzy closure L —system on L —ordered sets are introduced from the fuzzy point of view. We first explore the fundamental properties of fuzzy closure systems. Then the correspondence between fuzzy closure systems (fuzzy closure L —systems) and fuzzy closure operators is established. Finally, we study the connections between fuzzy closure systems and fuzzy Galois connections. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

On vector spaces over specific fields without choice

We investigate the deductive strength of statements concerning vector spaces over specific fields in the hierarchy of various choice principles.