PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC

DOI10.1002/MALQ.19920380150MaRDI QIDQ4295253zbMATH OpenOpenAlexFDO

Authors Paolo Gentilini

Publication date 11 July 1994

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19920380150

zbMATH Keywords

modal logicprovability logicprimitive recursive arithmeticNormal Form Theoremconstructive reductions on proof-trees in PRAproof-trees of provability logic sequents

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30)

Recommendations

• A proof theory for the logic of provability in true arithmetic
• Publication:3199395
• Provability logics relative to a fixed extension of Peano arithmetic
• On the provability logic of bounded arithmetic
• On arithmetical completeness of the logic of proofs
• Provability logics for natural Turing progressions of arithmetical theories
• Arithmetical Completeness of the Intuitionistic Logic of Proofs
• scientific article; zbMATH DE number 3957097
• Gentzen's consistency proofs for arithmetic
• Explicit Proofs in Formal Provability Logic

Cited in

(7)

• A proof theory for the logic of provability in true arithmetic
• A Direct Gentzen-Style Consistency Proof for Heyting Arithmetic
• Informational logic for automated reasoning
• Proof theory and mathematical meaning of paraconsistent C-systems
• A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
• scientific article; zbMATH DE number 5157044 (Why is no real title available?)
• From arithmetic expressions to propositional formulae

This page was built for publication: PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC

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