Computation on structures. Behavioural theory, logic, complexity

DOI10.1007/978-3-030-76020-5_15MaRDI QIDQ2117601zbMATH OpenOpenAlexFDO

Authors Klaus-Dieter Schewe

Publication date 22 March 2022

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

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)

Recommendations

• Discrete structures, logic and computability
• scientific article; zbMATH DE number 1001667
• Publication:4720780
• scientific article; zbMATH DE number 1344955
• scientific article; zbMATH DE number 994428
• 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

Cites work

• scientific article; zbMATH DE number 1650458 (Why is no real title available?)
• scientific article; zbMATH DE number 4009811 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 1841822 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• A Logic for Reflective ASMs
• A behavioural theory for reflective sequential algorithms
• A behavioural theory of recursive algorithms
• A complete logic for database abstract state machines
• A mathematical definition of full Prolog
• A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
• Abstract State Machines
• Abstract state machines capture parallel algorithms
• An extension of fixpoint logic with a symmetry-based choice construct
• Choiceless polynomial time
• Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
• Computability, complexity, logic. Transl. from the German
• Concurrent abstract state machines
• Datalog extensions for database queries and updates
• Elements of finite model theory.
• Evolving Algebras 1993: Lipari Guide
• Fixed-point Logics with Nondeterministic Choice
• Fixpoint logics, relational machines, and computational complexity
• On polynomial time computation over unordered structures
• Sequential abstract-state machines capture sequential algorithms
• Structure and complexity of relational queries
• The ASM refinement method

Cited in

(1)

• scientific article; zbMATH DE number 176729 (Why is no real title available?)

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)