An arithmetical completeness theorem for pre-permutations

DOI10.1305/NDJFL/1093634565MaRDI QIDQ689195zbMATH OpenOpenAlexFDO

Authors Friedemann Tuttas

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/1093634565

zbMATH Keywords

arithmetical completeness theoremmodal logicmodal sentencespre-permutational arithmetic interpretationswitness comparisons

Mathematics Subject Classification ID

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

Recommendations

• Syntactical results on the arithmetical completeness of modal logic
• Proof-theoretic modal PA-completeness. III: The syntactic proof
• Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
• Interpretability over peano arithmetic
• On the complexity of arithmetical interpretations of modal formulae

Cited in

(2)

• Alternative Characterizations of Precomplete Numerations
• scientific article; zbMATH DE number 2109538 (Why is no real title available?)

This page was built for publication: An arithmetical completeness theorem for pre-permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689195)