# Contracting Logics

@inproceedings{Ribeiro2012ContractingL, title={Contracting Logics}, author={M{\'a}rcio Moretto Ribeiro and Marcelo Esteban Coniglio}, booktitle={WoLLIC}, year={2012} }

In this paper, inspired in the field of belief revision, it is presented a novel operation for defining a new logic given a known logic. The operation consists in removing some (maybe undesirable) derived rule from a logic. Besides removing the ‘undesirable’ rule, this operation (called contraction) should change the logic in a minimal way. This paper presents formal definitions for contraction operations over logics, both as sets of rationality postulates and by means of concrete constructions…

## 2 Citations

Maximality in finite-valued Łukasiewicz logics defined by order filters

- Mathematics, Computer ScienceJ. Log. Comput.
- 2019

It is shown that the logics obtained from the (n+1)-valued Lukasiewicz logics by taking the order filter generated by i/n as the set of designated elements are ideal paraconsistent logics.

Degree-Preserving Gödel Logics with an Involution: Intermediate Logics and (Ideal) Paraconsistency

- Computer Science, PhilosophyOutstanding Contributions to Logic
- 2021

The notion of saturated paraconsistency is introduced, a weaker notion than ideal paraconsistentency, and a large family of saturatedParaconsistent logics in the family of intermediate logics for degree-preserving finite-valued Lukasiewicz logics is identified.

## References

SHOWING 1-10 OF 16 REFERENCES

BELIEF REVISION IN NON-CLASSICAL LOGICS

- PhilosophyThe Review of Symbolic Logic
- 2008

A belief revision approach for families of (non-classical) logics whose semantics are first-order axiomatisable and a general methodology to translate algebraic logics into classical logic is presented.

Maximal weakly-intuitionistic logics

- Computer ScienceStud Logica
- 1995

This article introduces the three-valuedweakly-intuitionistic logicI1 as a counterpart of the paraconsistent calculusP1 studied in [11], and shows that I1 is algebraizable in the sense of Block and Pigozzi (cf. [2]).

Modal logic

- PhilosophyArtificial Intelligence Review
- 2004

This paper shows how the tree or tableau method provides a simple and easily comprehensible decision procedure for systems such as K, T, S4 and S5 and how the formal techniques of modal logic can be used to analyse several informal problems involving modal concepts, including cases combining modality with quantification.

Belief contraction without recovery

- BiologyStud Logica
- 1991

This work replaces recovery with the seemingly much weaker postulate of core-retainment, which ensures that if x is excluded from K when p is contracted, then x plays some role for the fact that K implies p.

Hierarchies of Regulations and their Logic

- Computer Science
- 1981

The relations between derogation and delivery are investigated, showing that although the two processes appear and are generally assumed to be quite different from each other, nevertheless for finite inconsistent codes, the composite process of derogating and then selecting a remainder turns out to be equipowerful with delivery.

Theory of Logical Calculi: Basic Theory of Consequence Operations

- Philosophy
- 1988

0. Introduction.- 1. Basic Concepts.- 2. Deductive Bases and Interpretations.- 3. Logical Matrices.- 4. Tabular Semantics.- 5. Referential Semantics.- 6. Propositional vs. Predicate Logics.-…

The Logic of Theory Change

- PsychologyLecture Notes in Computer Science
- 1991

The logic of theory change is one of the literary work in this world in suitable to be reading material and this book gives reference, but also it will show the amazing benefits of reading a book.

On the propositional calculus P 1

- Mathematica Japonicae
- 1973