Fixed-point Logics with Nondeterministic Choice

DOI10.1093/LOGCOM/13.4.503MaRDI QIDQ4434612zbMATH OpenOpenAlexWikidataFDO

Authors 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

finite model-theoryfixed-point logicsnondeterminism

Mathematics Subject Classification ID

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

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

Cited in

(15)

• An extension of fixpoint logic with a symmetry-based choice construct
• Computation on structures. Behavioural theory, logic, complexity
• On non-deterministic quantification
• Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
• On the Descriptive Complexity of Linear Algebra
• scientific article; zbMATH DE number 4009811 (Why is no real title available?)
• scientific article; zbMATH DE number 1342208 (Why is no real title available?)
• scientific article; zbMATH DE number 1354147 (Why is no real title available?)
• The Logic of Choice
• Fixed Point Logics
• Computer Science Logic
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Choiceless polynomial time with witnessed symmetric choice
• Insignificant choice polynomial time. A logic capturing PTIME
• Choiceless polynomial time with witnessed symmetric choice

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)