The limits of decidability for first order logic on CPDA graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1245.68121
author: Christopher H. Broadbent
publication date: 2012-08-23T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 6070936
zbMATH Keywords: collapsible pushdown automata
zbMATH Keywords: first-order logic
zbMATH Keywords: logical reflection
MaRDI profile type: Publication
DOI: 10.4230/LIPICS.STACS.2012.589
Recommended article: On first-order logic and CPDA graphs
Recommended article: First-Order Logic on CPDA Graphs
Recommended article: Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic
Recommended article: Q4737148
Recommended article: On the parameterized complexity of graph modification to first-order logic properties
Recommended article: The Exact Complexity of the First-Order Logic Definability Problem
Recommended article: The first order definability of graphs: Upper bounds for quantifier depth
Recommended article: Q4942635
Recommended article: Graph-based decision for Gödel-Dummett logics
title: The limits of decidability for first order logic on CPDA graphs
description: scientific article; zbMATH DE number 6070936