Strengthening Consistency Results in Modal Logic

07/11/2023
by   Samuel Allen Alexander, et al.
0

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the assumptions codified by the theory in question to be consistent with those background axioms. But determining the specific choice and division of background axioms is, at least sometimes, little more than tradition. This paper introduces **generic theories** for propositional modal logic to address consistency results in a more robust way. As building blocks for background knowledge, generic theories provide a standard for categorical determinations of consistency. We argue that the results and methods of this paper help to elucidate problems in epistemology and enjoy sufficient scope and power to have purchase on problems bearing on modalities in judgement, inference, and decision making.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
12/17/2021

Can we Fix the Scope for Coreference? Problems and Solutions for Benchmarks beyond OntoNotes

Current work on automatic coreference resolution has focused on the Onto...
research
09/20/2018

Complete Additivity and Modal Incompleteness

In this paper, we tell a story about incompleteness in modal logic. The ...
research
07/22/2020

A sound interpretation of Leśniewski's epsilon in modal logic KTB

In this paper, we shall show that the following translation I^M from the...
research
03/17/2016

Predicate Gradual Logic and Linguistics

There are several major proposals for treating donkey anaphora such as d...
research
11/30/2020

Multimodal Dependent Type Theory

We introduce MTT, a dependent type theory which supports multiple modali...
research
04/22/2009

Toggling operators in computability logic

Computability logic (CL) (see http://www.cis.upenn.edu/ giorgi/cl.html )...

Please sign up or login with your details

Forgot password? Click here to reset