Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,455,463 papers from all fields of science
Search
Sign In
Create Free Account
Tarski–Kuratowski algorithm
Known as:
Tarski-Kuratowski algorithm
In computability theory and mathematical logic the Tarski–Kuratowski algorithm is a non-deterministic algorithm which provides an upper bound for the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Analytical hierarchy
Arithmetical hierarchy
Existential quantification
List of algorithms
Expand
Broader (2)
Computability theory
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
1982
1982
A characterization of the uniform closure of the set of homeomorphisms of a compact totally disconnected metric space into itself
F. B. Miles
1982
Corpus ID: 123141333
The limit index X(x) of a point x in a compact metric space is defined. (Roughly: Isolated points have index 0, limit points have…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required