Intermediate logics and Visser's rules
From MaRDI portal
Publication:558441
DOI10.1305/ndjfl/1107220674zbMath1102.03032OpenAlexW1982890778WikidataQ56474449 ScholiaQ56474449MaRDI QIDQ558441
Publication date: 6 July 2005
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1107220674
Related Items
On rules, Admissible inference rules and semantic property of modal logics, Almost structural completeness; an algebraic approach, Multiple Conclusion Rules in Logics with the Disjunction Property, A syntactic approach to unification in transitive reflexive modal logics, Consequence relations and admissible rules, The basic intuitionistic logic of proofs, UNIFICATION IN INTERMEDIATE LOGICS, Tutorial on Admissible Rules in Gudauri, A Note on Extensions: Admissible Rules via Semantics, Complexity of admissible rules, On unification and admissible rules in Gabbay-de Jongh logics, THE FIRST-ORDER LOGIC OF CZF IS INTUITIONISTIC FIRST-ORDER LOGIC, Admissible rules in the implication-negation fragment of intuitionistic logic, Hereditarily structurally complete intermediate logics: Citkin's theorem via duality, Realisability for infinitary intuitionistic set theory, Unnamed Item, A note on admissible rules and the disjunction property in intermediate logics, Admissibility and refutation: some characterisations of intermediate logics, Finite frames fail: how infinity works its way into the semantics of admissibility, PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS, On the rules of intermediate logics, The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\), Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics, Hereditarily structurally complete superintuitionistic deductive systems, Sugihara algebras: admissibility algebras via the test spaces method, Deductive systems with multiple-conclusion rules and the disjunction property, Proof theory for admissible rules, Canonical rules, DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV, Admissibility via natural dualities
Cites Work
- Unnamed Item
- Unnamed Item
- Admissibility of logical inference rules
- On the admissible rules of intuitionistic propositional logic
- A Resolution/Tableaux Algorithm for Projective Approximations in IPC
- Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
- A propositional calculus with denumerable matrix
- Unification in intuitionistic logic
- A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property
- Hypersequent Calculi for Godel Logics -- a Survey
- Computer Science Logic
- A(nother) characterization of intuitionistic propositional logic
