Proof-theoretic modal PA-completeness. I: A system-sequent metric
From MaRDI portal
Publication:1970598
DOI10.1023/A:1005203020301zbMath0952.03069MaRDI QIDQ1970598
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
modal logic; proof theory; Peano arithmetic; provability logic; proof-tree; syntactic proof of PA-completeness
03B45: Modal logic (including the logic of norms)
03F30: First-order arithmetic and fragments
03F45: Provability logics and related algebras (e.g., diagonalizable algebras)
Related Items
Proof theory and mathematical meaning of paraconsistent C-systems, Abstract deduction and inferential models for type theory, Paraconsistent informational logic, Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework