Independent complete subalgebras of collapsing algebras
Indexed annihilators in lattices
The concept of annihilator in lattice was introduced by M. Mandelker. Although annihilators have some properties common with ideals, the set of all annihilators in need not be a lattice. We give the concept of indexed annihilator which generalizes it and we show the basic properties of the lattice of indexed annihilators. Moreover, distributive and modular lattices can be characterized by using of indexed annihilators.
Indexed annihilators in ordered sets
Individual ergodic theorem on a logic
Induced pseudoorders
Inequalities for a Pair of Maps S x S ... S with S a Finite Set.
Inequalities Involving Maps of Finite Sets.
Inequalities involving -functionals and semi complete lattice homomorphisms
Inevitability in diamond processes
Infimum and supremum completeness properties of ordered sets without axioms.
Infinite paths and cliques in random graphs
We study the thresholds for the emergence of various properties in random subgraphs of (ℕ, <). In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.
Information frames, implication systems and modalities.
We investigate the logical systems which result from introducing the modalities L and M into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Our results lead to the formulation of a uniform labelled refutation system for these logics.
Injectivity in model theory
Injectivity in the quasi-topo of separated presheaves on a complete Heyting algebra
Injektive Objekte in gewissen Kategorien der Verbände
Inner product in -groups
Integer partitions, tilings of -gons and lattices
In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of -gons (hexagons, octagons, decagons, etc.). We show that the sets of partitions, ordered with a simple dynamics, have the distributive lattice structure. Likewise, we show that the set of tilings of a -gon is the disjoint union of distributive lattices which we describe. We also discuss the special case of linear integer partitions, for which other dynamical models exist.
Integer Partitions, Tilings of 2D-gons and Lattices
In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of 2D-gons (hexagons, octagons, decagons, etc.). We show that the sets of partitions, ordered with a simple dynamics, have the distributive lattice structure. Likewise, we show that the set of tilings of a 2D-gon is the disjoint union of distributive lattices which we describe. We also discuss the special case of linear integer partitions, for which other dynamical models exist.
Integral closure in MV-algebras.
We study the consequences of assuming on an MV-algebra A that Σnnx exists for each x belonging to A.
Integral Domain Type Representations in Sheaves and Other Topoi.