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.     

σ‐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)     

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.     

ω‐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)     

Non Deterministic Classical Logic: The λμ++ ‐calculus

In this paper, we present an extension of λμ‐calculus called λμ⁺⁺‐calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on data types. This calculus allows also to program the parallel‐or.     

ON THE ITERATED ω-RULE

Let Γ_n(φ) be a formula of L_PA (PA = Peano Arithmetic) meaning “there is a proof of φ from PA-axioms, in which ω-rule is iterated no more than n times”. We examine relations over pairs of natural numbers of the kind. (n, k) ≦_H (n', k') iff PA + RFN_n' (H_k') ? RFN_n (H_k). Where H denotes one of the hierarchies ∑ or Π and RFN_n(C) is the scheme of the reflection principle for Γ_n restricted to formulas from the class C(Γ_n(φ) implies “φ is true”, for every φ ∈ C). Our main result is that. (n, k) ≦H (n', k') if n ≦ n' and k ≦ max (k', 2n' + 1).     

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.     

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)     

ω‐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 C*‐Like Locally Convex ∗︁‐Algebras

The main purpose of this paper is to define the notion of C*‐like locally convex∗︁‐algebras and to study the structure of such ∗︁‐algebras.     

S‐asymptotically ω‐periodic solutions for semilinear Volterra equations

We study S‐asymptotically ω‐periodic mild solutions of the semilinear Volterra equation u′(t)=(a* Au)(t)+f(t, u(t)), considered in a Banach space X, where A is the generator of an (exponentially) stable resolvent family. In particular, we extend the recent results for semilinear fractional integro‐differential equations considered in (Appl. Math. Lett. 2009; 22:865–870) and for semilinear Cauchy problems of first order given in (J. Math. Anal. Appl. 2008; 343(2): 1119–1130). Applications to integral equations arising in viscoelasticity theory are shown. Copyright © 2010 John Wiley & Sons, Ltd.     

ω-operations over partial enumerated sets

In the present paper we concentrate on fundamental problems concerning ω-operations over partial enumerated sets. The notion of “HOM-lifts” seems to be an adequate tool for this kind of investigations. MSC: 03D45, 18A30.     

On the Roots of σ‐Polynomials

Given a graph G of order n, the σ‐polynomial of G is the generating function where is the number of partitions of the vertex set of G into i nonempty independent sets. Such polynomials arise in a natural way from chromatic polynomials. Brenti (Trans Am Math Soc 332 (1992), 729–756) proved that σ‐polynomials of graphs with chromatic number at least had all real roots, and conjectured the same held for chromatic number . We affirm this conjecture.     

χ‐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.     

Minimal extensions of Π01 classes

A minimal extension of a Π⁰₁ class P is a Π⁰₁ class Q such that P ? Q, Q – P is infinite, and for any Π⁰₁ class R, if P ? R ? Q, then either R – P is finite or Q – R is finite; Q is a nontrivial minimal extension of P if in addition P and Q′ have the same Cantor‐Bendixson derivative. We show that for any class P which has a single limit point A, and that point of degree ≤ 0 , P admits a nontrivial minimal extension. We also show that as long as P is infinite, then P does not admit any decidable nontrivial minimal extension Q. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Order plus size of τ‐critical graphs

Let $G=\left(V,E\right)$ be a $\tau$‐critical graph with $\tau \left(G\right)=t$. Erd?s and Gallai proved that $\mid V\mid \le 2t$ and the bound $\mid E\mid \le \left(\genfrac{}{}{0ex}{}{t+1}{2}\right)$ was obtained by Erd?s, Hajnal, and Moon. We give here the sharp combined bound $\mid E\mid +\mid V\mid \le \left(\genfrac{}{}{0ex}{}{t+2}{2}\right)$ and find all graphs with equality.     

Hierarchies in φ‐spaces and applications

We establish some results on the Borel and difference hierarchies in φ‐spaces. Such spaces are the topological counterpart of the algebraic directed‐complete partial orderings. E.g., we prove analogs of the Hausdorff Theorem relating the difference and Borel hierarchies and of the Lavrentyev Theorem on the non‐collapse of the difference hierarchy. Some of our results generalize results of A. Tang for the space Pω. We also sketch some older applications of these hierarchies and present a new application to the question of characterizing the ω‐ary Boolean operations generating a given level of the Wadge hierarchy from the open sets. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

μ‐Pseudo almost automorphic solutions of abstract fractional integro‐differential neutral equations with an infinite delay

The aim of this work is to study μ‐pseudo almost automorphic solutions of abstract fractional integro‐differential neutral equations with an infinite delay. Thanks to some restricted hypothesis on the delayed data in the phase space, we ensure the existence of the ergodic component of the desired solution. Copyright © 2016 John Wiley & Sons, Ltd.     

Two Remarks on Partitions of ω with Finite Blocks

We prove that all algebras P(w)/I_R, where the I_R-'s are ideals generated by partitions of W into finite and arbitrary large elements, are isomorphic and homogeneous. Moreover, we show that the smallest size of a tower of such partitions with respect to the eventually-refining preordering is equal to the smallest size of a tower on ω.     

Intuitionistic ϵ- and τ-calculi

There are several open problems in the study of the calculi which result from adding either of Hilbert's ?- or τ-operators to the first order intuitionistic predicate calculus. This paper provides answers to several of them. In particular, the first complete and sound semantics for these calculi are presented, in both a “quasi-extensional” version which uses choice functions in a straightforward way to interpret the ?- or τ-terms, and in a form which does not require extensionality assumptions. Unlike the classical case, the addition of either operator to intuitionistic logic is non-conservative. Several interesting consequences of the addition of each operator are proved. Finally, the independence of several other schemes in either calculus are also proved, making use of the semantics supplied earlier in the paper.