Inessential features, ineliminable features, and modal logics for model theoretic syntax (Q1006492): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10849-007-9052-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021857564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PDL for ordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linguistics, Logic and Finite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and techniques in modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary induction on abstract structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modulo-counting quantifiers over finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank

Latest revision as of 04:09, 29 June 2024

scientific article
Language Label Description Also known as
English
Inessential features, ineliminable features, and modal logics for model theoretic syntax
scientific article

    Statements

    Inessential features, ineliminable features, and modal logics for model theoretic syntax (English)
    0 references
    0 references
    24 March 2009
    0 references
    This paper further develops the theory of model-theoretic syntax. The author looks at various modal logics for trees with the aim to reach a better understanding of what is a good logic for the formalisation of grammatical theories. The focus of the paper lies on the notion of an \textit{inessential feature}, that has been introduced by \textit{M. Kracht} [Lect. Notes Comput. Sci. 1328, 43--62 (1997; Zbl 0896.03023)]. The main result is a generalization of a theorem by Kracht [loc. cit.]: Any tree language that can be defined in a stronger logic, but not in some weaker logic, can be defined in the weaker logic with inessential features (assumption: all logics involved are weaker than MSO). The theorem is a consequence of a theorem by \textit{J. W. Thatcher} [J. Comput. Syst. Sci. 1, 317--322 (1967; Zbl 0155.01802)]. This shows that the various modal logics for trees differ precisely with respect to which inessential features of trees are eliminable or not. Furthermore, the author argues that the logic MSO might be too strong as a logic for formalizing grammatical theories, because it allows for the elimination of all inessential features.
    0 references
    0 references
    model-theoretic syntax
    0 references
    modal logic
    0 references
    tree automata
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references