First-Order Logic on Higher-Order Nested Pushdown Trees

DOI10.1145/2480759.2480760zbMath1353.68053arXiv1202.1980OpenAlexW2027482757WikidataQ130867553 ScholiaQ130867553MaRDI QIDQ2946692

Alexander Kartzow

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.1980

zbMATH Keywords

first-order logicdecidabilityEhrenfeucht-Fraïssé gamepumping lemmafirst-oder model checkinghigher-order pushdown graphhigher-order pushdown systemnested pushdown tree

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

This page was built for publication: First-Order Logic on Higher-Order Nested Pushdown Trees