Attraction sets in abstract attainability problems: equivalent representations and basic properties
From MaRDI portal
Publication:2439392
DOI10.3103/S1066369X13110030zbMath1284.93035MaRDI QIDQ2439392
Publication date: 14 March 2014
Published in: Russian Mathematics (Search for Journal in Brave)
Related Items (13)
On the question of construction of an attraction set under constraints of asymptotic nature ⋮ On an asymptotic analysis problem related to the construction of an attainability domain ⋮ Compactifiers in extension constructions for reachability problems with constraints of asymptotic nature ⋮ Some topological structures of extensions of abstract reachability problems ⋮ SOME REPRESENTATIONS CONNECTED WITH ULTRAFILTERS AND MAXIMAL LINKED SYSTEMS ⋮ To a Question on the Supercompactness of Ultrafilter Spaces ⋮ On the structure of ultrafilters and properties related to convergence in topological spaces ⋮ Ultrafilters and maximal linked systems ⋮ Superextension as bitopological space ⋮ The Wallman compactifier and its application for investigation of the abstract attainability problem ⋮ Ultrafilters as admissible generalized elements under asymptotic constraints ⋮ Filters and linked families of sets ⋮ A problem related to asymptotic attainability in the mean
Cites Work
- Generalized limits and representations of attraction sets in problems with constraints of asymptotic character
- Ultrafilters in the constructions of attraction sets: problem of compliance to constraints of asymptotic character
- Ultrafilters of measurable spaces as generalized solutions in abstract attainability problems
- Extensions of abstract problems of attainability: nonsequential version
- Extension of an abstract attainability problem with the use of the Stone representation space
- Finitely additive measures and extensions of abstract control problems
- Representation of attraction elements in abstract attainability problems with asymptotic constraints
- Filters and ultrafilters in the constructions of attraction sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Attraction sets in abstract attainability problems: equivalent representations and basic properties