DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Tree (set theory)
Tree (set theory)
A New Order Theory of Set Systems and Better Quasi-Orderings
Normal Tree Orders for Infinite Graphs
BETTER QUASI-ORDERS for UNCOUNTABLE CARDINALS T
1. the Zermelo Fraenkel Axioms of Set Theory
SET THEORY 1. the Suslin Problem 1.1. the Suslin Hypothesis. Recall
Initial Embeddings in the Surreal Number Tree A
Searching in Dynamic Tree-Like Partial Orders
Choice Functions and Well-Orderings Over the Infinite Binary Tree
Better-Quasi-Order: Ideals and Spaces
Lexicographically Ordered Trees
Isomorphism Types of Trees1 1
A City Is Not a Semilattice Either
Lecture 4.3: Partially Ordered Sets
Suslin's Problem
TREES in SET THEORY 1. Introduction Although I Was
Iteration Trees
BINARY TREES and the N-CUTSET PROPERTY
Embedding Trees in the Rationals J
Top View
The Suslin Problem
Set Theory – an Overview 1 of 34 Set Theory – an Overview Gary Hardegree Department of Philosophy University of Massachusetts Amherst, MA 01003
Historical Remarks on Suslin's Problem
On a Classification of Aroszajn Trees
Arxiv:2003.08146V2 [Math.LO] 21 Jun 2020 ..Eeetr Umdl N Imns10 6 8 the Interlude: Construction Simple 3
Arxiv:1805.08164V2 [Math.LO]
Remarks on Souslin Properties and Tree
The Axioms of Set Theory
Well Quasi-Order in Combinatorics: Embeddings and Homomorphisms
Lecture 4: Trees
WELL-QUASI-ORDERING INFINITE GRAPHS with FORBIDDEN FINITE PLANAR MINOR Embedding V(T)
Leaf-Line Tree: a Data Structure for Efficiently Searching Dynamic Tree
Squares, Ascent Paths, and Chain Conditions 11