scientific article; zbMATH DE number 7652671

MaRDI QIDQ5873989FDOQ5873989

Authors:

Publication date: 10 February 2023

Title of this publication is not available (Why is that?)

Recommendations

• Proof method of partial correctness and weak completeness for normal logic programs
• scientific article; zbMATH DE number 4068837
• scientific article; zbMATH DE number 1136087
• Algorithmic structural completeness and a retrieval system for proving theorems in algorithmic theories
• scientific article; zbMATH DE number 4041873
• The Deduction Theorem for Strong Propositional Proof Systems
• scientific article; zbMATH DE number 7699443
• scientific article; zbMATH DE number 4081513
• On good algorithms for determining unsatisfiability of propositional formulas
• On some properties of complete by expressibility systems of formulas in the Gödel–Löb provability logic

zbMATH Keywords

provability logicclones of operationsultra-weak expressibility

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Many-valued logic (03B50) Logic with extra quantifiers and operators (03C80) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)

This page was built for publication:

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