Some notes on the superintuitionistic logic of chequered subsets of R^∞

08/20/2018
by   Tadeusz Litak, et al.
0

I investigate the superintuitionistic analogue of the modal logic of chequered subsets of R^∞ introduced by van Benthem et al. It is observed that this logic possesses the disjunction property, contains the Scott axiom, fails to contain the Kreisel-Putnam axiom and it is a sublogic of the Medvedev logic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2018

Finite Model Property of Pretransitive Modal Logic

The finite model property of the pretransitive modal logic K_2,3=K⊕ p→ p...
research
07/11/2019

From Hybrid Modal Logic to Matching Logic and back

Building on our previous work on hybrid polyadic modal logic we identify...
research
02/26/2018

The Finite Model Property of Quasi-transitive Modal Logic

The finite model property of the quasi-transitive modal logic K_2^3=K⊕ p...
research
05/30/2022

Updating belief functions over Belnap–Dunn logic

Belief and plausibility are weaker measures of uncertainty than that of ...
research
12/10/2020

On Coalgebraic Many-Valued Modal Logic

In this paper, we investigate the many-valued version of coalgebraic mod...
research
07/10/2023

Some Preliminary Steps Towards Metaverse Logic

Assuming that the term 'metaverse' could be understood as a computer-bas...
research
07/15/2019

Logic Conditionals, Supervenience, and Selection Tasks

Principles of cognitive economy would require that concepts about object...

Please sign up or login with your details

Forgot password? Click here to reset