Fixed-point Logics with Nondeterministic Choice

DOI10.1093/logcom/13.4.503zbMath1045.03033OpenAlexW2063132466WikidataQ58215714 ScholiaQ58215714MaRDI QIDQ4434612

Anuj Dawar, David Richerby

Publication date: 10 November 2003

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/13.4.503

zbMATH Keywords

nondeterminismfixed-point logicsfinite model-theory

Mathematics Subject Classification ID

Logic in computer science (03B70) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (3)

On the Descriptive Complexity of Linear Algebra ⋮ Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs ⋮ Computation on structures. Behavioural theory, logic, complexity

This page was built for publication: Fixed-point Logics with Nondeterministic Choice