PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC

DOI10.1002/MALQ.19920380150zbMath0794.03079OpenAlexW2031261959MaRDI QIDQ4295253

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) Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (2)

Proof theory and mathematical meaning of paraconsistent C-systems ⋮ Informational logic for automated reasoning

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