Operational logic of proofs with functionality condition on proof predicate

DOI10.1007/3-540-63045-7_18MaRDI QIDQ4376057zbMATH OpenFDO

Authors Vladimir Nikolaevich Krupskiĭ

Publication date 1 June 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63045-7_18

zbMATH Keywords

arithmetical completenessaxiomatic description for functional proof predicatescut-eliminationdecidabilityprovability logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 1320664
• Provability logic with operations on proofs
• scientific article; zbMATH DE number 1735872

Cited in

(4)

• Referential logic of proofs
• Symmetric Logic of Proofs
• The single-conclusion proof logic and inference rules specification
• Logic of proofs and provability

This page was built for publication: Operational logic of proofs with functionality condition on proof predicate

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