نتایج جستجو برای: Domain finiteness

تعداد نتایج: 408867  

Journal: :Indagationes Mathematicae (Proceedings) 1963

Journal: :Indagationes Mathematicae (Proceedings) 1963

Journal: :Indagationes Mathematicae (Proceedings) 1964

Journal: :Mathematische Annalen 2022

We prove that every amenable group of cohomological dimension two whose integral ring is a domain solvable and investigate certain homological finiteness properties groups satisfy the analytic zero divisor conjecture act on an acyclic CW-complex with stabilisers.

Journal: :Annals of Operations Research 2022

Abstract We contribute to the literature on statistical robustness of risk measures by computing index qualitative for based utility functions. This problem is intimately related finding natural domain finiteness and continuity such measures.

Inthispaper, (L,M)-fuzzy domain finiteness and (L,M)-fuzzy restricted hull spaces are introduced, and several characterizations of the category (L,M)-CS of (L,M)-fuzzy convex spaces are obtained. Then, (L,M)-fuzzy stratified (resp. weakly induced, induced) convex spaces are introduced. It is proved that both categories, the category (L,M)-SCS of (L,M)-fuzzy stratified convex spaces and the cate...

Journal: :International Journal of Analysis and Applications 2021

The objective of this research paper is to describe the behaviour boundary derivative conformal maps from polygon domain onto unit disk through construct some an interesting cases, and its inverse maps. Moreover, we study existence finiteness integrability over infinite sector W.

Journal: :CoRR 2001
Roberto Bagnara Roberta Gori Patricia M. Hill Enea Zaffanella

Logic languages based on the theory of rational, possibly infinite, trees have muchappeal in that rational trees allow for faster unification (due to the safe omission ofthe occurs-check) and increased expressivity (cyclic terms can provide very efficientrepresentations of grammars and other useful objects). Unfortunately, the use ofinfinite rational trees has problems. For inst...

2004
Roberto Bagnara Roberta Gori Patricia M. Hill

Logic languages based on the theory of rational, possibly infinite, trees have muchappeal in that rational trees allow for faster unification (due to the safe omission ofthe occurs-check) and increased expressivity (cyclic terms can provide very efficientrepresentations of grammars and other useful objects). Unfortunately, the use ofinfinite rational trees has problems. For inst...

Journal: :Transactions of the American Mathematical Society 1987

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید