Add to ORKGIn [KL14] the first two authors started a systematic study of the following objects: Definition 1.1. A tree T ⊆ ω<ω is called a full-splitting Miller tree iff every t ∈ T has an extension s ∈ T such that s is full-splitting, i.e., s_〈n 〉 ∈ T fo
A fundamental problem in classification is how to combine collections of trees having overlapping se...
The main observational equivalences of the untyped lambda-calculus have been characterized in terms ...
AbstractA fundamental problem in classification is how to combine collections of trees having overla...
We investigate two closely related partial orders of trees on omega(omega) : the full-splitting Mill...
We investigate two closely related partial orders of trees on ωω: the full-splitting Miller trees an...
Abstract. We discuss the question which properties of smallness in the sense of measure and category...
principle imply the existence of a Souslin tree? We consider proper forcings based upon countable tr...
An earlier paper by the same author set out a symbolic notation for tree architecture designed to co...
summary:An extended tree of a graph is a certain analogue of spanning tree. It is defined by means o...
<p>In this example, the parameter space consists of two parameters <i>X</i> and <i>Y</i> ranging fro...
A lower ideal of trees is a set I of finite trees such that if T ∈ I and T topologically contains S ...
Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic J...
Summary. An extended tree of a graph is a certain analogue of spanning tree. It is defined by means ...
Tree structure of Rizzi’s [51] Split-CP hypothesis (adopted from Rizzi, 1997, p. 297).</p
Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct...
A fundamental problem in classification is how to combine collections of trees having overlapping se...
The main observational equivalences of the untyped lambda-calculus have been characterized in terms ...
AbstractA fundamental problem in classification is how to combine collections of trees having overla...
We investigate two closely related partial orders of trees on omega(omega) : the full-splitting Mill...
We investigate two closely related partial orders of trees on ωω: the full-splitting Miller trees an...
Abstract. We discuss the question which properties of smallness in the sense of measure and category...
principle imply the existence of a Souslin tree? We consider proper forcings based upon countable tr...
An earlier paper by the same author set out a symbolic notation for tree architecture designed to co...
summary:An extended tree of a graph is a certain analogue of spanning tree. It is defined by means o...
<p>In this example, the parameter space consists of two parameters <i>X</i> and <i>Y</i> ranging fro...
A lower ideal of trees is a set I of finite trees such that if T ∈ I and T topologically contains S ...
Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic J...
Summary. An extended tree of a graph is a certain analogue of spanning tree. It is defined by means ...
Tree structure of Rizzi’s [51] Split-CP hypothesis (adopted from Rizzi, 1997, p. 297).</p
Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct...
A fundamental problem in classification is how to combine collections of trees having overlapping se...
The main observational equivalences of the untyped lambda-calculus have been characterized in terms ...
AbstractA fundamental problem in classification is how to combine collections of trees having overla...