Completeness and Decidability in Sequence Logic

DOI10.1007/978-3-540-75560-9_11MaRDI QIDQ3498460zbMATH OpenOpenAlexFDO

Authors Marc Bezem, Tore Langholm, Michał Walicki

Publication date 15 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75560-9_11

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70)

Recommendations

• Decidability in the logic of subsequences and supersequences
• scientific article; zbMATH DE number 1670483
• Completeness for recursive procedures in separation logic
• Sequent logic of arithmetic decidability
• Expressive completeness and decidability
• On completeness of logic programs
• Proving completeness for nested sequent calculi
• Completeness for linear continuous logic
• Completeness theory for propositional logics
• Completed logic programs and their consistency

Cited in

(8)

• Developing bounded reasoning
• Expressive completeness and decidability
• Algebraic properties implying weak sequential completeness
• scientific article; zbMATH DE number 1670483 (Why is no real title available?)
• The logic of sequences
• Decidability and Specker sequences in intuitionistic mathematics
• Decidability in the logic of subsequences and supersequences
• Sequential operators in computability logic

This page was built for publication: Completeness and Decidability in Sequence Logic

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