σ‐short Boolean algebras

We introduce properties of Boolean algebras which are closely related to the existence of winning strategies in the Banach‐Mazur Boolean game. A σ‐short Boolean algebra is a Boolean algebra that has a dense subset in which every strictly descending sequence of length ω does not have a nonzero lower bound. We give a characterization of σ‐short Boolean algebras and study properties of σ‐short Boolean algebras. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Admissible perturbations of α‐ψ‐pseudocontractive operators: convergence theorems

We prove some convergence theorems for α‐ψ‐pseudocontractive operators in real Hilbert spaces, by using the concept of admissible perturbation. Our results extend and complement some theorems in the existing literature. Copyright © 2016 John Wiley & Sons, Ltd.     

Sperner spaces and first‐order logic

We study the class of Sperner spaces, a generalized version of affine spaces, as defined in the language of pointline incidence and line parallelity. We show that, although the class of Sperner spaces is a pseudo‐elementary class, it is not elementary nor even ??_∞ω‐axiomatizable. We also axiomatize the first‐order theory of this class.     

ω‐categorical weakly o‐minimal expansions of Boolean lattices

We study ω‐categorical weakly o‐minimal expansions of Boolean lattices. We show that a structure ?? = (A,≤, ?) expanding a Boolean lattice (A,≤) by a finite sequence I of ideals of A closed under the usual Heyting algebra operations is weakly o‐minimal if and only if it is ω‐categorical, and hence if and only if A/I has only finitely many atoms for every I ∈ ?. We propose other related examples of weakly o‐minimal ω‐categorical models in this framework, and we examine the internal structure of these models.     

On some sets of dictionaries whose ω ‐powers have a given

A dictionary is a set of finite words over some finite alphabet X. The ω ‐power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V. Lecomte studied in [10] the complexity of the set of dictionaries whose associated ω ‐powers have a given complexity. In particular, he considered the sets ??( Σ ⁰k) (respectively, ??( Π ⁰_k), ??( Δ ¹₁)) of dictionaries V ? 2* whose ω ‐powers are Σ ⁰_k‐sets (respectively, Π ⁰_k‐sets, Borel sets). In this paper we first establish a new relation between the sets ??( Σ ⁰₂) and ??( Δ ¹₁), showing that the set ??( Δ ¹₁) is “more complex” than the set ??( Σ ⁰₂). As an application we improve the lower bound on the complexity of ??( Δ ¹₁) given by Lecomte, showing that ??( Δ ¹₁) is in Σ ¹ ₂(2^2*)\ Π ⁰₂. Then we prove that, for every integer k ≥ 2 (respectively, k ≥ 3), the set of dictionaries ??( Π ⁰_k+1) (respectively, ??( Σ ⁰_{k +1})) is “more complex” than the set of dictionaries ??( Π ⁰_k) (respectively, ??( Σ ⁰_k)) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Pseudo asymptotically periodic mild solutions of semilinear functional integro‐differential equations in Banach spaces

In this paper, we introduce and investigate the functions of (μ,ν)‐pseudo S‐asymptotically ω‐periodic of class r(class infinity). We systematically explore the properties of these functions in Banach space including composition theorems. As applications, we establish some sufficient criteria for (μ,ν)‐pseudo S‐asymptotic ω‐periodicity of (nonautonomous) semilinear integro‐differential equations with finite or infinite delay. Finally, some interesting examples are presented to illustrate the main findings.     

On effective σ‐boundedness and σ‐compactness

We prove several dichotomy theorems which extend some known results on σ‐bounded and σ‐compact pointsets. In particular we show that, given a finite number of $\Delta ^{1}_{1}$ equivalence relations $\mathrel {\mathsf {F}}_1,\dots ,\mathrel {\mathsf {F}}_n$, any $\Sigma ^{1}_{1}$ set A of the Baire space either is covered by compact $\Delta ^{1}_{1}$ sets and lightface $\Delta ^{1}_{1}$ equivalence classes of the relations $\mathrel {\mathsf {F}}_i$, or A contains a superperfect subset which is pairwise $\mathrel {\mathsf {F}}_i$‐inequivalent for all i = 1, …, n. Further generalizations to $\Sigma ^{1}_{2}$ sets A are obtained.     

The Computational Power of ℳ︁ω

We prove that the Kleene schemes for primitive recursion relative to the μ‐operator, relativized to some nondeterministic objects, have the same power to express total functionals when interpreted over the partial continuous functionals and over the Kleene‐Kreisel continuous functionals. Relating the former interpretation to Niggl's ℳ︁^ω we prove Nigg's conjecture that ℳ︁^ω is strictly weaker than Plotkin's PCF + PA.     

Fixed points of (α,ψ)‐contractions in Hausdorff partial metric spaces

The concept of (α,ψ)‐contractions was introduced by Samet et al. in this paper, we introduce (α,ψ)‐generalized contractions in a Hausdorff partial metric space. We discuss its significance and obtain some common fixed point theorems for a pair of self‐mappings. Some examples are given to support the theory.     

Calderón – Zygmund Operators on Weighted Weak Hardy Spaces in Locally Compact Vilenkin Groups

Let G be a bounded locally compact Vilenkin group. We study the atomic decom‐position of weighted weak Hardy space. We also define several Calderón – Zygmund type operators and study their boundedness on, spaces like weighted Hardy spaces, weighted weak Hardy spaces and weighted weak Lebesgue spaces. Sharpness of some of our results is also discussed.     

ω‐saturated quasi‐minimal models of Th(ℚω, +, σ, 0)

We show that (ℚ^ω, +, σ, 0) is a quasi-minimal torsion-free divisible abelian group. After discussing the axiomatization of the theory of this structure, we present its ω-saturated quasi-minimal model. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Long Borel hierarchies

We show that there is a model of ZF in which the Borel hierarchy on the reals has length ω₂. This implies that ω₁ has countable cofinality, so the axiom of choice fails very badly in our model. A similar argument produces models of ZF in which the Borel hierarchy has exactly λ + 1 levels for any given limit ordinal λ less than ω₂. We also show that assuming a large cardinal hypothesis there are models of ZF in which the Borel hierarchy is arbitrarily long. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Characterization of g∞,σ‐integral operators

The application of the general tensor norms theory of Defant and Floret to the ideal of (p, σ)‐absolutely continuous operators of Matter, 0 < σ < 1, 1 ≤ p < ∞ leads to the study of g_p′,σ‐nuclear and g_p′,σ‐integral operators. Characterizations of such operators has been obtained previously in the case p > 1. In this paper we characterize the g_∞,σ‐nuclear and g_∞,σ‐integral operators by the existence of factorizations of some special kinds. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Index sets for ω‐languages

An ω‐language is a set of infinite sequences (words) on a countable language, and corresponds to a set of real numbers in a natural way. Languages may be described by logical formulas in the arithmetical hierarchy and also may be described as the set of words accepted by some type of automata or Turing machine. Certain families of languages, such as the languages, may enumerated as P₀, P₁, … and then an index set associated to a given property R (such as finiteness) of languages is just the set of e such that P_e has the property. The complexity of index sets for 7 types of languages is determined for various properties related to the size of the language.     

On the Boolean algebras of definable sets in weakly o‐minimal theories

We consider the sets definable in the countable models of a weakly o‐minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence T is p‐ω‐categorical), in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete (convex) subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o‐minimal theory is p‐ω‐categorical. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On κ‐hereditary Sets and Consequences of the Axiom of Choice

We will prove that some so‐called union theorems (see [2]) are equivalent in ZF⁰ to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω₁ (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172.     

Pseudo asymptotically periodic solutions for Volterra integro‐differential equations

In this paper, we propose a new class of functions called pseudo ‐asymptotically ω‐periodic function in the Stepanov sense and explore its properties in Banach spaces including composition results. Furthermore, the existence and uniqueness of the pseudo ‐asymptotically ω‐periodic mild solutions to Volterra integro‐differential equations is investigated. Applications to integral equations arising in the study of heat conduction in materials with memory are shown. Copyright © 2014 John Wiley & Sons, Ltd.     

Classifying countable Boolean terms

We deal with the Borel and difference hierarchies in the space P of all subsets of endowed with the Scott topology. (The spaces P and 2 coincide set-theoretically but differ topologically.) We look at the Wadge reducibility in P. The results obtained are applied to the problem of characterizing ₁-terms t which satisfy C = t( ₁ ⁰ ) for a given Borel-Wadge class C. We give its solution for some levels of the Wadge hierarchy, in particular, all levels of the Hausdorff difference hierarchy. Finally, we come up with a discussion of some relevant facts and open questions.__________Translated from Algebra i Logika, Vol. 44, No. 2, pp. 173–197, March–April, 2005.     

χ‐bounded families of oriented graphs

A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic number of a graph is large enough, either the graph contains a clique of size k or it contains T as an induced subgraph. We discuss some results and open problems about extensions of this conjecture to oriented graphs. We conjecture that for every oriented star S and integer k, if the chromatic number of a digraph is large enough, either the digraph contains a clique of size k or it contains S as an induced subgraph. As an evidence, we prove that for any oriented star S, every oriented graph with sufficiently large chromatic number contains either a transitive tournament of order 3 or S as an induced subdigraph. We then study for which sets of orientations of P₄ (the path on four vertices) similar statements hold. We establish some positive and negative results.     

Existence of μ−pseudo almost periodic solutions to some evolution equations

In this article, a new approach for pseudo almost periodic solution under the measure theory, under Acquistpace‐Terreni conditions. We make extensive use of interpolation spaces and exponential dichotomy techniques to obtain the existence of μ‐pseudo almost periodic solutions to some classes of nonautonomous partial evolution equations. For illustration, we propose some application to a nonautonomous heat equation. Copyright © 2017 John Wiley & Sons, Ltd.