Modal-epistemic variants of Shapiro's system of epistemic arithmetic

DOI10.1305/NDJFL/1094061865MaRDI QIDQ1344441zbMATH OpenOpenAlexFDO

Authors Leon Horsten

Publication date 13 February 1995

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

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

zbMATH Keywords

Heyting arithmeticModal-Epistemic Arithmeticpossible-worlds semantics

Mathematics Subject Classification ID

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

Review text

Shapiro's Epistemic Arithmetic, EA, adds an operator, \(K\), to classical first-order arithmetic; this operator, interpreted informally as `is provable in principle', has an S4-like (Barcan-free) modal structure. First-order Heyting arithmetic, HA, can then be translated naturally into EA so that a formula \(A\) is provable in HA iff its translation is provable in EA. Here a Modal-Epistemic Arithmetic, MEA, is defined in which Shapiro's \(K\) is divided into a modal component, \(\diamondsuit\), for possibility, and an epistemic component, \(P\), for `is proved by some mathematician'. \(\diamondsuit\) has an S5-like modal structure (with Barcan) plus the axiom \(\diamondsuit A\to A\) when \(A\) is non-modal. Further postulates are given for \(P\) and combinations of \(P\) and \(\diamondsuit\). It is then shown that there is a translation from EA to MEA and hence a translation from HA to MEA such that \(A\) is provable in HA iff its translation is provable in MEA. A possible-worlds semantics is provided for one system of MEA and, although, of course, no full completeness theorem can be proved, the pure logical fragment of MEA is said to be semantically complete.

Recommendations

• Modal-epistemic arithmetic and the problem of quantifying in
• On modal systems having arithmetical interpretations
• On intuitionistic modal epistemic logic
• The modal status of contextually a priori arithmetical truths
• A new modal framework for epistemic logic
• scientific article; zbMATH DE number 1097010
• Arithmetical interpretations and Kripke frames of predicate modal logic of provability
• Intuitionistic epistemology and modal logics of verification
• On the complexity of arithmetical interpretations of modal formulae
• Epistemic predicates in the arithmetical context

Cited in

(11)

• In defense of epistemic arithmetic
• Provability in principle and controversial constructivistic principles
• Modal-epistemic arithmetic and the problem of quantifying in
• The epistemic significance of numerals
• Closure of a priori knowability under a priori knowable material implication
• Flagg realizability in arithmetic
• Two Proof-Theoretic Remarks on EA + ECT
• Reflecting in epistemic arithmetic
• Realizability semantics for quantified modal logic: generalizing Flagg's 1985 construction
• Structuralism and informal provability
• Nondeterministic first-order T-BAT logic

This page was built for publication: Modal-epistemic variants of Shapiro's system of epistemic arithmetic

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