Proof-theoretic modal PA-completeness. II: The syntactic countermodel

DOI10.1023/A:1005266731458zbMath0952.03070OpenAlexW1544138228MaRDI QIDQ1970646

Paolo Gentilini

Publication date: 4 June 2000

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

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

zbMATH Keywords

proof theoryprovability logicRosser sentencessyntactic proof of PA-completenesshierarchy in arithmetical interpretationssyntactic countermodels

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

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