Intermediate logics and Visser's rules (Q558441): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Nick Bezhanishvili / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B55 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 2186751 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
intermediate logic | |||
Property / zbMATH Keywords: intermediate logic / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
basis of admissible rules | |||
Property / zbMATH Keywords: basis of admissible rules / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1305/ndjfl/1107220674 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1982890778 / 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 | |||
links / mardi / name | links / mardi / name | ||
Revision as of 12:22, 10 June 2024
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
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
0 references