On the modal logic of subset and superset: tense logic over Medvedev frames
From MaRDI portal
Publication:519848
DOI10.1007/s11225-016-9680-1zbMath1417.03152OpenAlexW2489834239MaRDI QIDQ519848
Publication date: 7 April 2017
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/0379725f
modal logicdefinabilityaxiomatizabilitycomplement modalitydifference modalityKripke frame incompletenessMedvedev framesnominal tense logic
Related Items (5)
MEREOLOGICAL BIMODAL LOGICS ⋮ On the modal logic of Jeffrey conditionalization ⋮ Tense logics over lattices ⋮ STANDARD BAYES LOGIC IS NOT FINITELY AXIOMATIZABLE ⋮ B-frame duality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural connections between a forcing class and its modal logic
- Nominal tense logic
- Modal logic for other-world agnostics: Neutrality and Halldén incompleteness
- Modal definability in enriched languages
- On two problems of Harvey Friedman
- Inaccessible worlds
- Modal logic with names
- Logics of some Kripke frames connected with Medvedev notion of informational types
- Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable
- Sahlqvist Formulas in Hybrid Polyadic Modal Logics
- Topological Perspective on the Hybrid Proof Rules
- Interpolation for extended modal languages
- Transitivity follows from Dummett's axiom
- Using the Universal Modality: Gains and Questions
- The modal logic of inequality
- An ascending chain of S4 logics
- The Range of Modal Logic
- The modal logic of forcing
- Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
- The decidability of the Kreisel-Putnam system
- Multiple Forcing
This page was built for publication: On the modal logic of subset and superset: tense logic over Medvedev frames
