14 citations · 23 across the 3 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2019★ 14 cited
The Provability of Consistency
Sergei Artemov
We offer a mathematical proof of consistency for Peano Arithmetic PA formalizable in PA. This result is compatible with Goedel's Second Incompleteness Theorem since our consistency…
math.LO2016★ 2 cited
Knowing the Model
Sergei Artemov
Epistemic modal logic normally views an epistemic situation as a Kripke model. We consider a more basic approach: to view an epistemic situation as a set W of possible states/world…