Search results for "relation"

showing 10 items of 10542 documents

A decomposition theorem for compact-valued Henstock integral

2006

We prove that if X is a separable Banach space, then a measurable multifunction Γ : [0, 1] → ck(X) is Henstock integrable if and only if Γ can be represented as Γ = G + f, where G : [0, 1] → ck(X) is McShane integrable and f is a Henstock integrable selection of Γ.

Discrete mathematicsIntegrable systemSelection (relational algebra)MultifunctionHenstock integralIf and only ifGeneral MathematicsBanach spacePettis integralKurzweil–Henstock–Pettis integral selectionSeparable spaceMathematicsDecomposition theorem
researchProduct

Unified Metrical Common Fixed Point Theorems in 2-Metric Spaces via an Implicit Relation

2013

We prove some common fixed point theorems for two pairs of weakly compatible mappings in 2-metric spaces via an implicit relation. As an application to our main result, we derive Bryant's type generalized fixed point theorem for four finite families of self-mappings which can be utilized to derive common fixed point theorems involving any finite number of mappings. Our results improve and extend a host of previously known results. Moreover, we study the existence of solutions of a nonlinear integral equation.

Discrete mathematicsLeast fixed point2-metric space common property (E.A) common limit range property weakly compatible mappings implicit relations fixed point.Metric spaceSchauder fixed point theoremArticle SubjectSettore MAT/05 - Analisi MatematicaFixed-point theoremType (model theory)Fixed-point propertyCoincidence pointFinite setMathematicsJournal of Operators
researchProduct

Subgroups of $$SF(\omega )$$ S F ( ω ) and the relation of almost containedness

2016

The relations of almost containedness and orthogonality in the lattice of groups of finitary permutations are studied in the paper. We define six cardinal numbers naturally corresponding to these relations by the standard scheme of $$P(\omega )$$P(ź). We obtain some consistency results concerning these numbers and some versions of the Ramsey theorem.

Discrete mathematicsLogic010102 general mathematics0102 computer and information sciencesLattice (discrete subgroup)01 natural sciencesOmegaCombinatoricsMathematics::LogicPhilosophyOrthogonality010201 computation theory & mathematicsConsistency (statistics)Scheme (mathematics)FinitaryRamsey's theorem0101 mathematicsRelation (history of concept)MathematicsArchive for Mathematical Logic
researchProduct

The Infinite-Valued Łukasiewicz Logic and Probability

2017

The paper concerns the algebraic structure of the set of cumulative distribution functions as well as the relationship between the resulting algebra and the infinite-valued Łukasiewicz algebra. The paper also discusses interrelations holding between the logical systems determined by the above algebras. Zadanie „ Wdrożenie platformy Open Journal System dla czasopisma „ Bulletin of the Section of Logic” finansowane w ramach umowy 948/P-DUN/2016 ze środków Ministra Nauki i Szkolnictwa Wyższego przeznaczonych na działalność upowszechniającą naukę.

Discrete mathematicsLogicprobabilityconsequence relationCumulative distribution functionPhilosophy03G20the infinite-valued standard Łukasiewicz algebracumulative distribution functionŁukasiewicz logic06D3060A05MathematicsBulletin of the Section of Logic
researchProduct

Logics with counting and equivalence

2014

We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NEXPTIME-complete. We further show that the corresponding problems for two-variable first-order logic with counting and two equivalences are both undecidable.

Discrete mathematicsLogical equivalenceComplexityHigher-order logicSatisfiabilityUndecidable problemStipulationCombinatoricsBinary predicateTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESEquivalence relationComputer Science::Logic in Computer ScienceEquivalence relationSatisfiabilityEquivalence (formal languages)MathematicsProceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
researchProduct

Ordering and Convex Polyominoes

2005

We introduce a partial order on pictures (matrices), denoted by ≼ that extends to two dimensions the subword ordering on words. We investigate properties of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order. In particular we consider the families of polyominoes and convex polyominoes and the family, recently introduced by the authors, of L-convex polyominoes. In the first part of the paper we study the closure properties of such families with respect to the order. In particular we obtain a new characterization of L-convex polyominoes: a discrete set P is a L-convex polyomino if and only if all the elements Q≼P are polyominoes. In the seco…

Discrete mathematicsMathematics::CombinatoricsPolyominoBinary relationRegular polygonConvex setDiscrete geometryMonotonic functionPartial OrderComputer Science::Computational GeometryMonotone FunctionCombinatoricsClosure PropertyBinary RelationFormal Language TheoryClosure (mathematics)Computer Science::Discrete MathematicsPartially ordered setComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Periodicity vectors for labelled trees

2003

AbstractThe concept of a periodicity vector is introduced in the context of labelled trees, and some new periodicity theorems are obtained. These results constitute generalizations of the classical periodicity theorem of Fine and Wilf for words. The concept of a tree congruence is also generalized and the isomorphism between the lattice of tree congruences and the lattice of unlabelled trees (prefix codes) is established.

Discrete mathematicsMonoidPrefix codePeriodicityApplied MathematicsContext (language use)Congruence relationTree (graph theory)CombinatoricsFormal languagesLattice (music)Labelled treeCongruence (manifolds)Periodicity vectorDiscrete Mathematics and CombinatoricsIsomorphismMathematicsDiscrete Applied Mathematics
researchProduct

General aggregation operators based on a fuzzy equivalence relation in the context of approximate systems

2016

Our paper deals with special constructions of general aggregation operators, which are based on a fuzzy equivalence relation and provide upper and lower approximations of the pointwise extension of an ordinary aggregation operator. We consider properties of these approximations and explore their role in the context of extensional fuzzy sets with respect to the corresponding equivalence relation. We consider also upper and lower approximations of a t-norm extension of an ordinary aggregation operator. Finally, we describe an approximate system, considering the lattice of all general aggregation operators and the lattice of all fuzzy equivalence relations.

Discrete mathematicsPointwiseLogic05 social sciencesFuzzy set050301 educationContext (language use)02 engineering and technologyExtension (predicate logic)Lattice (discrete subgroup)Operator (computer programming)Artificial Intelligence0202 electrical engineering electronic engineering information engineeringEquivalence relationApplied mathematics020201 artificial intelligence & image processing0503 educationOrdered weighted averaging aggregation operatorMathematicsFuzzy Sets and Systems
researchProduct

Einklassige Geschlechter totalpositiver quadratischer Formen in totalreellen algebraischen Zahlkörpern

1971

Abstract It is proved that totally positive quadratic forms with three or more variables and class number h = 1 exist only in a finite number of algebraic number fields. Each field allows only a finite number of such forms with bounded scale. To prove this, upper estimates for all local factors in Siegel's analytic formula are constructed by calculating explicitly numbers of solutions of quadratic congruences.

Discrete mathematicsPure mathematicsAlgebra and Number TheoryQuadratic equationBounded functionBinary quadratic formField (mathematics)Quadratic fieldAlgebraic numberCongruence relationFinite setMathematicsJournal of Number Theory
researchProduct

The parameterized local deduction theorem for quasivarieties of algebras and its application

1996

Let τ be an algebraic type. To each classK of τ-algebras a consequence relation ⊧ K defined on the set of τ-equations is assigned. Some weak forms of the deduction theorem for ⊧ K and their algebraic counterparts are investigated. The (relative) congruence extension property (CEP) and its variants are discussed.CEP is shown to be equivalent to a parameter-free form of the deduction theorem for the consequence ⊧ K .CEP has a strong impact on the structure ofK: for many quasivarietiesK,CEP implies thatK is actually a variety. This phenomenon is thoroughly discussed in Section 5. We also discuss first-order definability of relative principal congruences. This property is equivalent to the fact…

Discrete mathematicsPure mathematicsDeduction theoremAlgebra and Number TheoryFundamental theoremQuasivarietyNo-go theoremStructure (category theory)Congruence relationVariety (universal algebra)Finite setMathematicsAlgebra Universalis
researchProduct