Intermediate logics and Visser's rules (Q558441): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import recommendations run Q6534273
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1305/ndjfl/1107220674 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q56474449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypersequent Calculi for Godel Logics -- a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propositional calculus with denumerable matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Resolution/Tableaux Algorithm for Projective Approximations in IPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the admissible rules of intuitionistic propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A(nother) characterization of intuitionistic propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissibility of logical inference rules / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1305/NDJFL/1107220674 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: On the rules of intermediate logics / rank
 
Normal rank
Property / Recommended article: On the rules of intermediate logics / qualifier
 
Similarity Score: 0.84311634
Amount0.84311634
Unit1
Property / Recommended article: On the rules of intermediate logics / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4487248 / rank
 
Normal rank
Property / Recommended article: Q4487248 / qualifier
 
Similarity Score: 0.81721437
Amount0.81721437
Unit1
Property / Recommended article: Q4487248 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics / rank
 
Normal rank
Property / Recommended article: Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics / qualifier
 
Similarity Score: 0.79906243
Amount0.79906243
Unit1
Property / Recommended article: Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics / qualifier
 
Property / Recommended article
 
Property / Recommended article: Admissible Rules of Lukasiewicz Logic / rank
 
Normal rank
Property / Recommended article: Admissible Rules of Lukasiewicz Logic / qualifier
 
Similarity Score: 0.7877544
Amount0.7877544
Unit1
Property / Recommended article: Admissible Rules of Lukasiewicz Logic / qualifier
 
Property / Recommended article
 
Property / Recommended article: Independent Bases of Admissible Rules / rank
 
Normal rank
Property / Recommended article: Independent Bases of Admissible Rules / qualifier
 
Similarity Score: 0.78506356
Amount0.78506356
Unit1
Property / Recommended article: Independent Bases of Admissible Rules / qualifier
 
Property / Recommended article
 
Property / Recommended article: The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\) / rank
 
Normal rank
Property / Recommended article: The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\) / qualifier
 
Similarity Score: 0.78462344
Amount0.78462344
Unit1
Property / Recommended article: The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\) / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2746913 / rank
 
Normal rank
Property / Recommended article: Q2746913 / qualifier
 
Similarity Score: 0.7775272
Amount0.7775272
Unit1
Property / Recommended article: Q2746913 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Admissible rules in the implication-negation fragment of intuitionistic logic / rank
 
Normal rank
Property / Recommended article: Admissible rules in the implication-negation fragment of intuitionistic logic / qualifier
 
Similarity Score: 0.7637554
Amount0.7637554
Unit1
Property / Recommended article: Admissible rules in the implication-negation fragment of intuitionistic logic / qualifier
 
Property / Recommended article
 
Property / Recommended article: Rules of inference with parameters for intuitionistic logic / rank
 
Normal rank
Property / Recommended article: Rules of inference with parameters for intuitionistic logic / qualifier
 
Similarity Score: 0.7628522
Amount0.7628522
Unit1
Property / Recommended article: Rules of inference with parameters for intuitionistic logic / qualifier
 
Property / Recommended article
 
Property / Recommended article: On rules / rank
 
Normal rank
Property / Recommended article: On rules / qualifier
 
Similarity Score: 0.7552492
Amount0.7552492
Unit1
Property / Recommended article: On rules / qualifier
 

Latest revision as of 20:04, 27 January 2025

scientific article
Language Label Description Also known as
English
Intermediate logics and Visser's rules
scientific article

    Statements

    Intermediate logics and Visser's rules (English)
    0 references
    0 references
    6 July 2005
    0 references
    A set \(R\) of admissible rules forms a basis of admissible rules for a logic \(L\) if all the admissible rules of \(L\) can be derived from \(R\). It was proved by the author [J. Symb. Log. 66, 281--294 (2001; Zbl 0986.03013)] that the so-called Visser's rules form a basis of admissible rules for the intuitionistic propositional calculus \textbf{IPC}. This paper discusses bases of admissible rules for other intermediate logics. The paper shows that if all Visser's rules are admissible for an intermediate logic \(L\), then Visser's rules form a basis for \(L\). This implies that if all Visser's rules are derivable in \(L\), then all the admissible rules of \(L\) are derivable. As a result, the author obtains that the Dummett logic \textbf{LC} of linear Kripke frames does not have non-derivable admissible rules. The paper also gives a criterion for admissibility of Visser's rules. Namely, it is shown that Visser's rules are admissible (and therefore, by the result mentioned above, form a basis) for an intermediate logic \(L\) iff \(L\) has the offspring property (which is a special kind of an extension property). As a corollary, the author derives that Visser's rules are admissible for the intermediate logic \textbf{KC} of all directed Kripke frames, and that there exist logics with the disjunction property for which not all Visser's rules are admissible.
    0 references
    intermediate logic
    0 references
    basis of admissible rules
    0 references

    Identifiers