Idempotence de l'opération de souslin
Idempotent and compact matrices on linear lattices: A survey of some lattice results and related solutions of finite relational equations.
Identity and permutation.
If it looks and smells like the reals...
Given a topological space ⟨X,T⟩ ∈ M, an elementary submodel of set theory, we define to be X ∩ M with topology generated by U ∩ M:U ∈ T ∩ M. We prove that if is homeomorphic to ℝ, then . The same holds for arbitrary locally compact uncountable separable metric spaces, but is independent of ZFC if “local compactness” is omitted.
IF-filters of pseudo-BL-algebras
Characterizations of IF-filters of a pseudo-BL-algebra are established. Some related properties are investigated. The notation of prime IF- filters and a characterization of a pseudo-BL-chain are given. Homomorphisms of IF-filters and direct product of IF-filters are studied.
Immunity and simplicity for exact counting and other counting classes
Immunity and Simplicity for Exact Counting and Other Counting Classes
Ko [26] and Bruschi [11] independently showed that, in some relativized world, PSPACE (in fact, ⊕P) contains a set that is immune to the polynomial hierarchy (PH). In this paper, we study and settle the question of relativized separations with immunity for PH and the counting classes PP, , and ⊕P in all possible pairwise combinations. Our main result is that there is an oracle A relative to which contains a set that is immune BPP⊕P. In particular, this set is immune to PHA and to ⊕PA. Strengthening...
Implication algebras
We introduce the concepts of pre-implication algebra and implication algebra based on orthosemilattices which generalize the concepts of implication algebra, orthoimplication algebra defined by J.C. Abbott [2] and orthomodular implication algebra introduced by the author with his collaborators. For our algebras we get new axiom systems compatible with that of an implication algebra. This unified approach enables us to compare the mentioned algebras and apply a unified treatment of congruence properties....
Implication and equivalential reducts of basic algebras
A term operation implication is introduced in a given basic algebra and properties of the implication reduct of are treated. We characterize such implication basic algebras and get congruence properties of the variety of these algebras. A term operation equivalence is introduced later and properties of this operation are described. It is shown how this operation is related with the induced partial order of and, if this partial order is linear, the algebra can be reconstructed by means of...
Implicative hyper -algebras
In this note we first define the notions of (weak, strong) implicative hyper -algebras. Then we show by examples that these notions are different. After that we state and prove some theorems which determine the relationship between these notions and (weak) hyper -ideals. Also we obtain some relations between these notions and (weak) implicative hyper -ideals. Finally, we study the implicative hyper -algebras of order 3, in particular we obtain a relationship between the positive implicative...
Impulse noise removal based on new hybrid conjugate gradient approach
Image denoising is a fundamental problem in image processing operations. In this paper, we present a two-phase scheme for the impulse noise removal. In the first phase, noise candidates are identified by the adaptive median filter (AMF) for salt-and-pepper noise. In the second phase, a new hybrid conjugate gradient method is used to minimize an edge-preserving regularization functional. The second phase of our algorithm inherits advantages of both Dai-Yuan (DY) and Hager-Zhang (HZ) conjugate gradient...
In which categories are first-order axiomatizable hulls characterizable by ultraproducts ?
Inaccessible cardinals without the axiom of choice
We consider four notions of strong inaccessibility that are equivalent in ZFC and show that they are not equivalent in ZF.
...-inaccessible ordinals, collapsing functions and a recursive notation system.
Incompactness in languages with infinitely long expressions
Incomparability with respect to the triangular order
In this paper, we define the set of incomparable elements with respect to the triangular order for any t-norm on a bounded lattice. By means of the triangular order, an equivalence relation on the class of t-norms on a bounded lattice is defined and this equivalence is deeply investigated. Finally, we discuss some properties of this equivalence.
Incomparable families and maximal trees
We answer several questions of D. Monk by showing that every maximal family of pairwise incomparable elements of 𝒫(ω)/fin has size continuum, while it is consistent with the negation of the Continuum Hypothesis that there are maximal subtrees of both 𝒫(ω) and 𝒫(ω)/fin of size ω₁.
Incomparable, non-isomorphic and minimal Banach spaces
A Banach space contains either a minimal subspace or a continuum of incomparable subspaces. General structure results for analytic equivalence relations are applied in the context of Banach spaces to show that if E₀ does not reduce to isomorphism of the subspaces of a space, in particular, if the subspaces of the space admit a classification up to isomorphism by real numbers, then any subspace with an unconditional basis is isomorphic to its square and hyperplanes, and the unconditional basis has...
Indécidabilité de la théorie des anneaux de séries formelles à plusieurs indéterminées
Independent instances for some undecidable problems