6 research outputs found

    The ehrenfeucht conjecture: An algebra-framework for its proof

    Get PDF
    AbstractWe describe an algebraic framework including, in particular, the affine monoid of a given ring. Within this framework it is a simple matter to deduce Ehrenfeucht's Conjecture from Hilbert's Basis Theorem

    A first-order axiomatization of the theory of finite trees

    Get PDF
    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

    On the Ehrenfeucht conjecture for DOL languages

    Full text link

    Countable approximations and Löwenheim-Skolem theorems

    Get PDF

    The expressive power of Malitz quantifiers for linear orderings

    Get PDF
    corecore