AbstractThis paper studies logical definability of tree languages (sets of finite trees). The logical systems are consider are located between first-order logic and monadic second-order logic. We obtain results which clarify the expressive power of first-order logic extended by “modulo-counting quantifiers”
Abstract In this paper, we prove that for any language L of finitely branching finite and infinite ...
We provide first-order axioms for the theories of finite trees with bounded branching and finite tre...
AbstractWe investigate notions of decidability and definability for the Monadic Second-Order Logic o...
We study an extension of monadic second-order logic of order with the uncountability quantifier ``th...
AbstractWe give a combinatorial method for proving elementary equivalence in first-order logic FO wi...
We study an extension of monadic second-order logic of order with the uncountability quantifier ``th...
We consider regular languages of labeled trees. We give an effective characterization of the regular...
This paper gives a thorough overview of what is known about first-order logic with counting quantif...
We give a survey of the expressive power of various monadic logics on specific classes of finite lab...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
A modal logic U developed to deal with finite ordered binary trees a * they are used in (computation...
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...
In this thesis we investigate the expressive power of several logics over finite trees. In particula...
Abstract In this paper, we prove that for any language L of finitely branching finite and infinite ...
We provide first-order axioms for the theories of finite trees with bounded branching and finite tre...
AbstractWe investigate notions of decidability and definability for the Monadic Second-Order Logic o...
We study an extension of monadic second-order logic of order with the uncountability quantifier ``th...
AbstractWe give a combinatorial method for proving elementary equivalence in first-order logic FO wi...
We study an extension of monadic second-order logic of order with the uncountability quantifier ``th...
We consider regular languages of labeled trees. We give an effective characterization of the regular...
This paper gives a thorough overview of what is known about first-order logic with counting quantif...
We give a survey of the expressive power of various monadic logics on specific classes of finite lab...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
A modal logic U developed to deal with finite ordered binary trees a * they are used in (computation...
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...
In this thesis we investigate the expressive power of several logics over finite trees. In particula...
Abstract In this paper, we prove that for any language L of finitely branching finite and infinite ...
We provide first-order axioms for the theories of finite trees with bounded branching and finite tre...
AbstractWe investigate notions of decidability and definability for the Monadic Second-Order Logic o...
DOI
Add to ORKG