Skip to search formSkip to main contentSkip to account menu

Tree (set theory)

Known as: Tree (disambiguation), Tree (set theoretic) 
In set theory, a tree is a partially ordered set (T, <) such that for each t ∈ T, the set {s ∈ T : s < t} is well-ordered by the relation &lt… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Recently introduced approaches for relaxed query answering, approximately defining concepts, and approximately solving… 
2014
2014
This work builds on the notion of breadth-first signature of infinite trees and (prefix-closed) languages introduced by the… 
2013
2013
In perfect-information games in extensive form, common knowledge of rationality triggers backward induction, which yields a Nash… 
2009
2009
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in… 
2009
2009
In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We… 
2008
2008
Present world is characterized by ever growing volume of data collected and saved into data- bases. Data often can‘t be analysed… 
2007
2007
There is a well-known correspondence between infinite trees and ultrametric spaces which can be interpreted as an equivalence of… 
2005
2005
Tree structures provide a popular means to organize the information on the Web. Taxonomies of thematic categories, concept…