Fixed-point Logics with Nondeterministic Choice

DOI10.1093/LOGCOM/13.4.503zbMATH Open1045.03033OpenAlexW2063132466WikidataQ58215714 ScholiaQ58215714MaRDI QIDQ4434612FDOQ4434612

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

Recommendations

• Fixed Point Logics
• scientific article; zbMATH DE number 4009811
• An extension of fixpoint logic with a symmetry-based choice construct
• Semantics and expressive power of nondeterministic constructs in deductive databases
• Fixed-point extensions of first-order logic

zbMATH Keywords

nondeterminismfixed-point logicsfinite model-theory

Mathematics Subject Classification ID

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

Cited In (10)

• Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
• Computation on structures. Behavioural theory, logic, complexity
• Title not available (Why is that?)
• On the Descriptive Complexity of Linear Algebra
• Fixed Point Logics
• Computer Science Logic
• The Logic of Choice
• Choiceless polynomial time with witnessed symmetric choice
• Title not available (Why is that?)
• Formal Techniques for Networked and Distributed Systems - FORTE 2005

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434612)