Lewisian Fixed Points I: Two Incomparable Constructions

05/23/2019
by   Tadeusz Litak, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/05/2022

Correspondence Theory for Modal Fairtlough-Mendler Semantics of Intuitionistic Modal Logic

We study the correspondence theory of intuitionistic modal logic in moda...
research
01/12/1999

Fixpoint 3-valued semantics for autoepistemic logic

The paper presents a constructive fixpoint semantics for autoepistemic l...
research
08/29/2023

Conservativity of Type Theory over Higher-order Arithmetic

We investigate how much type theory is able to prove about the natural n...
research
04/27/2015

Theory of Semi-Instantiation in Abstract Argumentation

We study instantiated abstract argumentation frames of the form (S,R,I),...
research
03/22/2019

Probabilistic logics based on Riesz spaces

We introduce a novel real-valued endogenous logic for expressing propert...
research
06/13/2019

On the denotational semantics of Linear Logic with least and greatest fixed points of formulas

We develop a denotational semantics of Linear Logic with least and great...
research
05/14/2018

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages

We introduce a generic expression language describing behaviours of fini...

Please sign up or login with your details

Forgot password? Click here to reset