We provide first-order axioms for the theories of finite trees with bounded branching and finite trees with arbitrary (finite) branching. The signature is chosen to express, in a natural way, those properties of trees most relevant to linguistic theories. These axioms provide a foundation for results in linguistics that are based on reasoning formally about such properties. We include some observations on the expressive power of these theories relative to traditional language complexity classes
We propose axiomatizations of monadic second-order logic (MSO), monadic transitive closure logic (FO...
Summary. A contiuation of [5]. The notions of finite-order trees, succesors of an element of a tree,...
We study a first-order theory of finite full binary trees with an axiom schema of open induction. We...
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...
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...
Abstract. We present in this paper an automatic way to combine any first-order theory T with the the...
A modal logic U developed to deal with finite ordered binary trees a * they are used in (computation...
We present in this paper an automatic way to combine any first-order theory T with the theory of fin...
AbstractThis paper studies logical definability of tree languages (sets of finite trees). The logica...
Abstract—We present a general model-theoretic technique that we developed and used in [3], [4] to ob...
The theory of finite trees is the full first-order theory of equality in the Herbrand universum (the...
The theory of finite trees is the full first-order theory of equality in the Herbrand universum (the...
We propose axiomatizations of monadic second-order logic (MSO), monadic transitive closure logic (FO...
Summary. A contiuation of [5]. The notions of finite-order trees, succesors of an element of a tree,...
We study a first-order theory of finite full binary trees with an axiom schema of open induction. We...
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...
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...
Abstract. We present in this paper an automatic way to combine any first-order theory T with the the...
A modal logic U developed to deal with finite ordered binary trees a * they are used in (computation...
We present in this paper an automatic way to combine any first-order theory T with the theory of fin...
AbstractThis paper studies logical definability of tree languages (sets of finite trees). The logica...
Abstract—We present a general model-theoretic technique that we developed and used in [3], [4] to ob...
The theory of finite trees is the full first-order theory of equality in the Herbrand universum (the...
The theory of finite trees is the full first-order theory of equality in the Herbrand universum (the...
We propose axiomatizations of monadic second-order logic (MSO), monadic transitive closure logic (FO...
Summary. A contiuation of [5]. The notions of finite-order trees, succesors of an element of a tree,...
We study a first-order theory of finite full binary trees with an axiom schema of open induction. We...