Inessential features, ineliminable features, and modal logics for model theoretic syntax

DOI10.1007/S10849-007-9052-3zbMath1192.03004OpenAlexW2021857564MaRDI QIDQ1006492

Hans-Jörg Tiede

Publication date: 24 March 2009

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-007-9052-3

zbMATH Keywords

modal logictree automatamodel-theoretic syntax

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic of natural languages (03B65) Automata and formal grammars in connection with logical questions (03D05) Linguistics (91F20)

Related Items (1)

Querying linguistic trees

Cites Work

• Elementary induction on abstract structures
• Tools and techniques in modal logic
• Modulo-counting quantifiers over finite trees
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• PDL for ordered trees
• Linguistics, Logic and Finite Trees
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inessential features, ineliminable features, and modal logics for model theoretic syntax