summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and let $ H(W)$ be the set of all trees $T$ with the property that $W$ is the vertex set of $T$. We will find a one-to-one correspondence between $ H(W)$ and the set of all binary operations on $W$ which satisfy a certain set of three axioms (stated in this note)
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in...
Abstract. We show that the class of finite rooted binary plane trees is a Ramsey class (with respect...
In this paper, we prove that for any language $L$ of finitely branching finite and infinite trees, t...
summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and l...
summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and l...
We provide first-order axioms for the theories of finite trees with bounded branching and finite tre...
We provide first-order axioms for the theories of finite trees with bounded branching and finite tre...
We provide first-order axioms for the theories of finite trees with bounded branching and finite tre...
Summary. In the article we deal with sets of trees and functions yielding trees. So, we introduce th...
In this paper we introduce a description language for finite trees. Although we briefly note some of...
In this paper we introduce a description language for finite trees. Although we briefly note some of...
We study a first-order theory of finite full binary trees with an axiom schema of open induction. We...
A modal logic U developed to deal with finite ordered binary trees a * they are used in (computation...
AbstractThe subject of each of the five sections of this paper is the planted plane trees discussed ...
We propose axiomatizations of monadic second-order logic (MSO), monadic transitive closure logic (FO...
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in...
Abstract. We show that the class of finite rooted binary plane trees is a Ramsey class (with respect...
In this paper, we prove that for any language $L$ of finitely branching finite and infinite trees, t...
summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and l...
summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and l...
We provide first-order axioms for the theories of finite trees with bounded branching and finite tre...
We provide first-order axioms for the theories of finite trees with bounded branching and finite tre...
We provide first-order axioms for the theories of finite trees with bounded branching and finite tre...
Summary. In the article we deal with sets of trees and functions yielding trees. So, we introduce th...
In this paper we introduce a description language for finite trees. Although we briefly note some of...
In this paper we introduce a description language for finite trees. Although we briefly note some of...
We study a first-order theory of finite full binary trees with an axiom schema of open induction. We...
A modal logic U developed to deal with finite ordered binary trees a * they are used in (computation...
AbstractThe subject of each of the five sections of this paper is the planted plane trees discussed ...
We propose axiomatizations of monadic second-order logic (MSO), monadic transitive closure logic (FO...
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in...
Abstract. We show that the class of finite rooted binary plane trees is a Ramsey class (with respect...
In this paper, we prove that for any language $L$ of finitely branching finite and infinite trees, t...
DOI
Add to ORKG