scientific article; zbMATH DE number 3264065
From MaRDI portal
Publication:5549798
zbMath0165.01701MaRDI QIDQ5549798
K. Kuratowski, Andrzej Mostowski
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (85)
On the question of construction of an attraction set under constraints of asymptotic nature ⋮ Termination of term rewriting by interpretation ⋮ Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies ⋮ Towards a descriptive set theory for domain-like structures ⋮ PRODUCTS OF ULTRAFILTERS AND MAXIMAL LINKED SYSTEMS ON WIDELY UNDERSTOOD MEASURABLE SPACES ⋮ Aggregation of preferences by the generalized row sum method ⋮ On the construction of a predicate truth set ⋮ A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ Total termination of term rewriting ⋮ Compactifications, \(A\)-compactifications and proximities ⋮ Van der Waerden rings ⋮ On relations of equivalence and ordering ⋮ Relations of equivalence and ordering ⋮ Concurrent systems and inevitability ⋮ Unnamed Item ⋮ And so on \dots : reasoning with infinite diagrams ⋮ The program iteration method in a game problem of guidance ⋮ Fine hierarchy of regular \(\omega\)-languages ⋮ Unnamed Item ⋮ Higher moments of Banach space valued random variables ⋮ Baire functions, Borel sets, and ordinary function systems ⋮ On separably injective Banach spaces ⋮ Two-stage dynamic programming in the routing problem with decomposition ⋮ Distances to spaces of first resolvable class mappings ⋮ When are all closed subsets recurrent? ⋮ Fine hierarchies via Priestley duality ⋮ On ordinary and standard products of infinite family of \(\sigma \)-finite measures and some of their applications ⋮ Transfinite version of the program iteration method in a game problem of approach for an abstract dynamical system ⋮ Inductive definability: Measure and category ⋮ On Tabor's problem concerning a certain quasi-ordering of iterative roots of functions ⋮ SOME REPRESENTATIONS CONNECTED WITH ULTRAFILTERS AND MAXIMAL LINKED SYSTEMS ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ On certain problems of the structure of ultrafilters related to extensions of abstract control problems ⋮ Analytical identification of discrete objects ⋮ Measurable Parametrizations of Sets in Product Spaces ⋮ Ultrafilters and maximal linked systems: basic properties and topological constructions ⋮ On the supercompactness of ultrafilter space with the topology of Wallman type ⋮ The routing problems with optimization of the starting point: dynamic programming ⋮ Probabilistic and team PFIN-type learning: General properties ⋮ Constraints of asymptotic nature and attainability problems ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Certain problems of asymptotic analysis and extensions. II ⋮ Descriptive Complexity of Function Spaces ⋮ Unlocking of predicate: application to constructing a non-anticipating selection ⋮ Ultrafilters and maximal linked systems ⋮ Iterations of stability and the evasion problem with a constraint on the number of switchings of the formed control ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ \(LT\)-fuzzy sets ⋮ Turing degrees in refinements of the arithmetical hierarchy ⋮ Natural pseudo-distance and optimal matching between reduced size functions ⋮ Theories of initial segments of standard models of arithmetics and their complete extensions ⋮ Dynamic programming in the routing problem with complex dependence of costs on the list of jobs ⋮ Schreier sets in Ramsey theory ⋮ Algorithm of designing compound recognition system on the basis of combining classifiers with simultaneous splitting feature space into competence areas ⋮ On homotopy types of Alexandroff spaces ⋮ Brezis-Browder Principles and Applications ⋮ Interpolating hereditarily indecomposable Banach spaces ⋮ Information storage and retrieval - mathematical foundations. II: Combinatorial problems ⋮ Information storage and retrieval systems: Mathematical foundations ⋮ A discrete-continuous routing problem with precedence constraints ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ On the question of representation of ultrafilters and their application in extension constructions ⋮ Continuously Homogeneous Continua and their ARC Components ⋮ Block combinatorics ⋮ Total termination of term rewriting ⋮ U-shaped, iterative, and iterative-with-counter learning ⋮ The method of programmed iterations in abstract control problems ⋮ A topological completeness concept with applications to the open mapping theorem and the separation of convex sets ⋮ Wadge Degrees ofω-Languages of Deterministic Turing Machines ⋮ ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION ⋮ The programmed iteration method in a game problem of realizing trajectories in a function set ⋮ Fuzzy bags and relations with set-valued statistics ⋮ Ultrafilters as admissible generalized elements under asymptotic constraints ⋮ Filters and linked families of sets ⋮ Lyapunov bases of a vector space and maximal \(\lambda \)-subspaces ⋮ Guidance-evasion differential game: alternative solvability and relaxations of the guidance problem ⋮ On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Metrics and orders in space of fuzzy numbers ⋮ On the relaxation of a game problem of approach with priority elements ⋮ Finite incompatible deformations in elastic solids: relativistic approach ⋮ On Fodor's theorem: A topological version ⋮ Open mapping theorems in topological spaces ⋮ Limites et fonctions d'ensemble
This page was built for publication:
