Independent Bases of Admissible Rules

  title={Independent Bases of Admissible Rules},
  author={Emil Jeř{\'a}bek},
  journal={Log. J. IGPL},
  • Emil Jeřábek
  • Published 1 June 2008
  • Mathematics, Computer Science
  • Log. J. IGPL
We show that IPC , K4, GL, and S4, as well as all logics inheriting their admissible rules, have independent bases of admissible rules. 

Tables from this paper

Admissible Bases Via Stable Canonical Rules

AbstractWe establish the dichotomy property for stable canonical multi-conclusion rules for IPC, K4, and S4. This yields an alternative proof of existence of explicit bases of admissible rules for

On Rules

This paper contains a brief overview of the area of admissible rules with an emphasis on results about intermediate and modal propositional logics. No proofs are given but many references to the

UvA-DARE ( Digital Academic Repository ) Admissible bases via stable canonical rules

We establish the dichotomy property for stable canonical multi-conclusion rules for IPC, K4, and S4. This yields an alternative proof of existence of explicit bases of admissible rules for these

The complexity of admissible rules of Łukasiewicz logic

This work investigates the computational complexity of admissibility of inference rules in infinite-valued Łukasiewicz propositional logic and establishes that admissible rules of Ł are PSPACE-complete.

Multiple Conclusion Rules in Logics with the Disjunction Property

We prove that for the intermediate logics with the disjunction property any basis of admissible rules can be reduced to a basis of admissible m-rules (multiple-conclusion rules), and every basis of

Unification in modal and description logics

A survey of the results on unification obtained in two closely related, yet different, application areas of unification: description logics and modal logics is given.

Linear Temporal Logic LTL: Basis for Admissible Rules

The current article aims to provide an explicit (infinite) basis for rules admissible in LTL with operations Until and Next and to suggest a recursive infinite basis for admissible rules.

Intuitionistic Rules : Admissible Rules of Intermediate Logics

It is proved that finite models can not provide sound and complete semantics for logics of width greater than two that admit one particular variant of the Visser rules.

Canonical rules

Abstract We develop canonical rules capable of axiomatizing all systems of multiple-conclusion rules over K4 or IPC, by extension of the method of canonical formulas by Zakharyaschev [37]. We use the

Reasoning and Inference Rules in Basic Linear Temporal Logic BLTL\mathcal{BLTL}

Main result is found explicit basis for rules admissible in BLTL (which, in particular, allows to compute admissible rules).



Admissible Rules of Modal Logics

We construct explicit bases of admissible rules for a representative class of normal modal logics (including the systems K4, GL, S4, Grz, and GL:3), by extending the methods of S. Ghilardi and R.

Description of Modal Logics Inheriting Admissible Rules for S4

Using this condition, all tabular modal logics inheriting inference rules admissible for S4 are described.

On the admissible rules of intuitionistic propositional logic

A conjecture by de Jongh and Visser is proved and a proof system for the admissible rules of intuitionistic propositional logic is presented and semantic criteria for admissibility are given.

Best Solving Modal Equations

On the rules of intermediate logics

A brief overview of results on admissible rules in the context of intermediate logics is given and natural examples of logics for which the Visser rule are derivable, admissible but nonderivable, or not admissible are provided.

On the Independent Axiomatizability of Modal and Intermediate Logics

This paper gives a solution to the old independent axiomatizability problem by presenting normal modal logics above K4 and Grz and an intermediate logic without independent axiomatizations.

Construction of an Explicit Basis for Rules Admissible in Modal System S4

We find an explicit basis for all admissible rules of the modal logic S4. Our basis consists of an infinite sequence of rules which have compact and simple, readable form and depend on increasing set

Unification in intuitionistic logic

Abstract We show that the variety of Heyting algebras has finitary unification type. We also show that the subvariety obtained by adding it De Morgan law is the biggest variety of Heyting algebras

Intermediate Logics and Visser's Rules

The result can be generalized to arbitrary intermediate logics: Visser’s rules form a basis for the admissible rules of any intermediate logic L for which they are admissible, which implies that if Vissers rules are derivable for L then L has no non-derivable admissible Rules.

Frege systems for extensible modal logics