Substructural epistemic logics

@article{Sedlr2015SubstructuralEL,
  title={Substructural epistemic logics},
  author={Igor Sedl{\'a}r},
  journal={Journal of Applied Non-Classical Logics},
  year={2015},
  volume={25},
  pages={256 - 285}
}
  • I. Sedlár
  • Published 3 July 2015
  • Philosophy
  • Journal of Applied Non-Classical Logics
The article introduces substructural epistemic logics of belief supported by evidence. The logics combine normal modal epistemic logics (implicit belief) with distributive substructural logics (available evidence). Pieces of evidence are represented by points in substructural models and availability of evidence is modelled by a function on the point set. The main technical result is a general completeness theorem. Axiomatisations are provided by means of two-sorted Hilbert-style calculi. It is… 

Substructural Logics for Pooling Information

A generalization of the account of pooling information – offered by standard epistemic logic – based on intersection of sets of possible worlds based on information models for substructural logics and pooling is represented by fusion of information states is put forward.

Epistemic extensions of substructural inquisitive logics

A deductive system for the weakest epistemic inquisitive logic is described and completeness proved for this special case using the general method.

Knowledge Is a Diamond

This paper proposes a formal semantics for substructural logics that allows to model knowledge on the basis of intuition, and overcomes some unintuitive features of the semantics from [3].

Substructural Logics with a Reflexive Transitive Closure Modality

Decidability and weak completeness are obtained for intuitionistic modal logic with the reflexive transitive closure box in the modal non-associative commutative full Lambek calculus with a simple negation.

Weak relevant justification logics

This paper will develop ideas from [44]. We will generalize their work in two directions. First, we provide axioms for justification logics over the base logic B and show that the logic permits a

Relevant Reasoners in a Classical World

The main technical result of the paper is a modular completeness theorem parametrized by the relevant modal logic formalizing the agent’s reasoning.

From positive PDL to its non-classical extensions

A complete binary implicational axiomatization of the positive fragment of Propositional Dynamic Logic is provided to provide completeness proofs for non-classical extensions of positive PDL.

SUBSTRUCTURAL INQUISITIVE LOGICS

  • V. Punčochář
  • Philosophy, Computer Science
    The Review of Symbolic Logic
  • 2019
Any propositional logic that extends a basic substructural logic BSL (a weak, nondistributive, nonassociative, and noncommutative version of Full Lambek logic with a paraconsistent negation) can be enriched with questions in the style of inquisitive semantics and logic.

The Fundamental Problem of Logical Omniscience

A novel dynamic epistemic logic is presented that yields precisely the desired validities and invalidities for the logic of knowledge per se for arbitrary agents, for which it provides expressivity and completeness results.

Actual Issues for Relevant Logics

I is common enough in work on relevant logics using Routley-Meyer frames to talk about a real world. This is naturally construed as the formal representative of the actual world. It is a natural

References

SHOWING 1-10 OF 85 REFERENCES

Information, Awareness and Substructural Logics

The paper outlines a generalisation of the awareness-based epistemic semantics by Fagin and Halpern. Awareness is construed as a relation between agents and pieces of information instead of formulas.

Epistemic Models, Logical Monotony and Substructural Logics

Since the seminal work of [Hin62], classical epistemic logic (CEL) and its applications are undermined by the so-called problem of logical omniscience (PLO). Indeed, this problem is only one instance

Epistemic logics for sceptical agents

This article introduces an epistemic modal operator modelling knowledge over distributive non-associative full Lambek calculus with a negation, and proves decidability of the weakest epistemic logic it considers, using a filtration method.

Substructural Logics: A Primer

Preface. Part I: The philosophy of substructural logics. 1. The role of structural rules in sequent calculi. Part II: The proof theory of substructural logics. 2. Basic proof systems for

Dynamic Epistemic Logic as a Substructural Logic

  • Guillaume Aucher
  • Philosophy
    Johan van Benthem on Logic and Information Dynamics
  • 2014
It is shown that DEL can be redefined naturally and meaningfully as a two-sorted substructural logic and the ternary semantics of DEL and its dynamic interpretation provides a conceptual foundation for the Routley & Meyer’s semantics of substructures.

Epistemic closure and commutative, nonassociative residuated structures

The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi-agent information flow to be refocused onto mono-agent deductive reasoning.

Dynamic Logics of Evidence-Based Beliefs

This paper adds evidence structure to standard models of belief, in the form of families of sets of worlds. We show how these more fine-grained models support natural actions of “evidence

Belief Revision in a Nonclassical Logic

The original theory of belief revision by Alchourron, Gardenfors, and Makinson (AGM theory) is based on classical logic but properties like consistency and logical consequence are not suitable in the case of a reasoner with limited resources because of computational intractability.

Logic for Two: The Semantics of Distributive Substructural Logics

This is an account of the semantics of a family of logics whose paradigm member is the relevant logic R of Anderson and Belnap, and the basic concept of the treatment is that of an agent a reasoning to conclusions using as assumptions the theory of agent b.

Explicit provability and constructive semantics

This paper finds the logic LP of propositions and proofs and shows that Godel's provability calculus is nothing but the forgetful projection of LP, which achievesGodel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which resisted formalization since the early 1930s.
...