Proof-theoretic modal PA-completeness. II: The syntactic countermodel
From MaRDI portal
Publication:1970646
DOI10.1023/A:1005266731458zbMath0952.03070MaRDI QIDQ1970646
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
proof theory; provability logic; Rosser sentences; syntactic proof of PA-completeness; hierarchy in arithmetical interpretations; syntactic countermodels
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, 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