Proof-theoretic modal PA-completeness. I: A system-sequent metric

DOI10.1023/A:1005203020301zbMath0952.03069OpenAlexW1556492233MaRDI QIDQ1970598

Paolo Gentilini

Publication date: 7 June 2000

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005203020301

zbMATH Keywords

modal logicproof theoryPeano arithmeticprovability logicproof-treesyntactic proof of PA-completeness

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items (4)

Proof theory and mathematical meaning of paraconsistent C-systems ⋮ Paraconsistent informational logic ⋮ Abstract deduction and inferential models for type theory ⋮ Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework

This page was built for publication: Proof-theoretic modal PA-completeness. I: A system-sequent metric