scientific article; zbMATH DE number 2012391

MaRDI QIDQ4437809zbMATH OpenFDO

Authors Melvin Fitting

Publication date 15 December 2003

zbMATH Keywords

provabilityfixpointsProlog programGödel-Löb logic

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Recommendations

• Gödel's program
• On computability by logic programs
• Least fixed points in the Gödel-Löb logic
• Program derivation by fixed point computation
• Automated proofs of Löb's theorem and Gödel's two incompleteness theorems
• Fixed point theorems in logic programming
• Computing Minimal Axiomatizations in Godel Propositional Logic
• A realization theorem for the Gödel-Löb provability logic

Cited in

(2)

• Modal interpolation via nested sequents
• Least fixed points in the Gödel-Löb logic

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 Q4437809)