Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lewisian Fixed Points I: Two Incomparable Constructions

Published 23 May 2019 in cs.LO | (1905.09450v1)

Abstract: Our paper is the first study of what one might call "reverse mathematics of explicit fixpoints". We study two methods of constructing such fixpoints for formulas whose principal connective is the intuitionistic Lewis arrow. Our main motivation comes from metatheory of constructive arithmetic, but the systems in question allows several natural semantics. The first of these methods, inspired by de Jongh and Visser, turns out to yield a well-understood modal system. The second one by de Jongh and Sambin, seemingly simpler, leads to a modal theory that proves harder to axiomatize in an elegant way. Apart from showing that both theories are incomparable, we axiomatize their join and investigate several subtheories, whose axioms are obtained as fixpoints of simple formulas. We also show that they are extension stable, that is, their validity in the corresponding preservativity logic of a given arithmetical theory transfer to its finite extensions.

Authors (2)
Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.