Decision procedure of some relevant logics: a constructive perspective

  title={Decision procedure of some relevant logics: a constructive perspective},
  author={Jacques Riche},
  journal={Journal of Applied Non-Classical Logics},
  pages={23 - 9}
  • J. Riche
  • Published 1 January 2005
  • Mathematics
  • Journal of Applied Non-Classical Logics
Some investigations into the algebraic constructive aspects of a decision procedure for various fragments of Relevant Logics are presented. Decidability of these fragments relies on S. Kripke's gentzenizations and on his combinatorial lemma known as Kripke's lemma that B. Meyer has shown equivalent to Dickson's lemma in number theory and to his own infinite divisor lemma, henceforth, Meyer's lemma or IDP. These investigations of the constructive aspects of the Kripke's-Meyer's decision… 
1 Citations
Constructive Decision via Redundancy-Free Proof-Search
A constructive account of Kripke-Curry’s method which was used to establish the decidability of Implicational Relevance Logic is given, mechanize this method in axiom-free Coq, abstracting away from the specific features of \(\mathbf R_{{\rightarrow }}\) to keep only the essential ingredients of the technique.


The complexity of decision procedures in relevance logic II
  • A. Urquhart
  • Computer Science
    Journal of Symbolic Logic
  • 1999
In this paper, we show that there is no primitive recursive decision procedure for the implication-conjunction fragments of the relevant logics R, E and T, as well as for a family of related logics.
Kripke, Belnap, Urquhart and Relevant decidability & complexity
The first philosophically motivated sentential logics to be proved undecidable were relevant logics like R and E. But we deal here with important decidable fragments thereof, like
Improved Decision Procedures for Pure Relevant Logic
Finite model properties for various fragments of R, including R→ have the finite model property and are hence model-theoretically decidable and shown how to define various logical particles using Church’s propositional quantifiers, which turns what are conservative extension results at the quantifier-free level into axiomatic extensions when quantifiers are present.
Relevant and substructural logics
  • Greg Restall
  • Philosophy
    Logic and the Modalities in the Twentieth Century
  • 2006
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction
By means of two well-known examples it is demonstrated that the method of extracting programs from proofs is manageable in practice and may yield efficient programs. The Warshall algorithm computing
Constructive proof of Hilbert’s theorem on ascending chains
In a previous note it was shown that if a bound f(i) is placed on the degrees of the elements in some basis of an ideal Ai in the polynomial ring k[IX1, . . . 9 Xn] over an explicitly given field k,
Constructive Topology and Combinatorics
  • T. Coquand
  • Mathematics
    Constructivity in Computer Science
  • 1991
The proofs obtained by this method are well-suited for mechanisation in interactive proof systems that allow the user to introduce inductively defined notions, such as NuPrl, or Martin-Lof set theory.
Constructive mathematics and computer programming
  • P. Martin-Lof
  • Computer Science
    Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences
  • 1984
If programming is understood not as the writing of instructions for this or that computing machine but as the design of methods of computation that it is the computer’s duty to execute, then it no longer seems possible to distinguish the discipline of programming from constructive mathematics.
Truth or consequences : essays in honor of Nuel Belnap
On Two Deflationary Truth Theories.- Some Reflections On The Prosentential Theory of Truth.- Paradox and Reference.- Two Theorems concerning Stability.- The Complexity of Decision Procedures in