2014CUNY Academic Works (City University of New York)Open access

TR-2014004: Justification Logics and Realization

Melvin Fitting

Open full text 0 citations

Abstract

Justification logics are explicit versions of modal logics, in which reasons for formulas being so are part of the formula structure.Justification logics are connected with their corresponding modal logics through Realization Theorems.Beginning with S4, several standard modal logics have been shown to have justification counterparts: K, K4, S5, and so on.In this report we begin exploration of the question: what is the range of modal logics that have justification counterparts.We introduce general methodology that applies to all current examples, though non-constructively.We use this machinery to establish realization results for some new justification logics based on modal logics that have not been considered in justification context before.Our work is based on the machinery introduced in [9], but which is now examined in a general setting.The results presented here are not intended to be final, but represent a stage in a continuing investigation.

Open-access reader

About this research paper

What this paper is about

Justification logics are explicit versions of modal logics, in which reasons for formulas being so are part of the formula structure.Justification logics are connected with their corresponding modal logics through Realization Theorems.Beginning with S4, several standard modal logics have been shown to have justification counterparts: K, K4, S5, and so on.In this report we begin exploration of the question: what is the range of modal logics that have justification counterparts.We introduce general methodology that applies to all current examples, though non-constructively.We use this machinery to establish realization results for some new justification logics based on modal logics that have not been considered in justification context before.Our work is based on the machinery introduced in [9], but which is now examined in a general setting.The results presented here are not intended to be final, but represent a stage in a continuing investigation.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Justification logics are explicit versions of modal logics, in which reasons for formulas being so are part of the formula structure.Justification logics are connected with their corresponding modal logics through Realization Theorems.Beginning with S4, several standard modal logics have been shown to have justification counterparts: K, K4, S5, and so on.In this report we begin exploration of the question: what is the range of modal logics that have justification counterparts.We introduce general methodology that applies to all current examples, though non-constructively.We use this machinery to establish realization results for some new justification logics based on modal logics that have not been considered in justification context before.Our work is based on the machinery introduced in [9], but which is now examined in a general setting.The results presented here are not intended to be final, but represent a stage in a continuing investigation.

Key concepts: Modal, T-norm fuzzy logics, Accessibility relation, Realization (probability), Mathematics, Context (archaeology), Normal modal logic, Modal logic

Related papers

Back to paper searchBrowse research topicsOriginal source
TR-2014004: Justification Logics and Realization — Research Paper | ScholarLens