On the proofs of arithmetical completeness for interpretability logic

DOI10.1305/NDJFL/1093634485zbMath0788.03027OpenAlexW1987397575MaRDI QIDQ689212

Domenico Zambella

Publication date: 6 December 1993

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093634485

zbMATH Keywords

modal logicinterpretability logicVeltman modelsarithmetical completeness

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30)

Related Items (3)

A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic ⋮ Theory and application of labelling techniques for interpretability logics ⋮ Undecidability in diagonalizable algebras

This page was built for publication: On the proofs of arithmetical completeness for interpretability logic