Computation on structures. Behavioural theory, logic, complexity

DOI10.1007/978-3-030-76020-5_15OpenAlexW3168087681MaRDI QIDQ2117601FDOQ2117601

Klaus-Dieter Schewe

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-76020-5_15

Recommendations

• Discrete structures, logic and computability
• scientific article; zbMATH DE number 1001667
• Publication:4720780
• scientific article; zbMATH DE number 1344955
• scientific article
• scientific article; zbMATH DE number 1870419
• Compositionality, computability, and complexity
• Computability structures, simulations and realizability
• Foundations of logic and theory of computation
• scientific article; zbMATH DE number 6154472

zbMATH Keywords

complexity theorylogicparallel algorithmstheory of computationabstract state machinesbehavioural theoryPTIMEcomputation on structuresinsignificant choice

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Abstract State Machines
• Evolving Algebras 1993: Lipari Guide
• Elements of finite model theory.
• Datalog extensions for database queries and updates
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Concurrent abstract state machines
• A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
• Abstract state machines capture parallel algorithms
• Sequential abstract-state machines capture sequential algorithms
• The ASM refinement method
• Title not available (Why is that?)
• Structure and complexity of relational queries
• Computability, complexity, logic. Transl. from the German
• Fixpoint logics, relational machines, and computational complexity
• Choiceless polynomial time
• On polynomial time computation over unordered structures
• A mathematical definition of full Prolog
• An extension of fixpoint logic with a symmetry-based choice construct
• A unifying logic for non-deterministic, parallel and concurrent abstract state machines
• A complete logic for Database Abstract State Machines1
• Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
• Title not available (Why is that?)
• Fixed-point Logics with Nondeterministic Choice
• A Behavioural Theory of Recursive Algorithms
• A Behavioural Theory for Reflective Sequential Algorithms
• A Logic for Reflective ASMs

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Computation on structures. Behavioural theory, logic, complexity

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