On the rules of intermediate logics
From MaRDI portal
Publication:2501166
DOI10.1007/s00153-006-0320-8zbMath1096.03025OpenAlexW2000217311WikidataQ56474450 ScholiaQ56474450MaRDI QIDQ2501166
Publication date: 4 September 2006
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-006-0320-8
realizabilityadmissible rulesintermediate logicsMedvedev logicIndependence of PremiseRieger-Nishimura formulasVisser rules
Related Items
Multiple Conclusion Rules in Logics with the Disjunction Property, Complexity of admissible rules, On unification and admissible rules in Gabbay-de Jongh logics, Hereditarily structurally complete intermediate logics: Citkin's theorem via duality, Hilbert-style presentations of two logics associated to tetravalent modal algebras, UNIFICATION IN SUPERINTUITIONISTIC PREDICATE LOGICS AND ITS APPLICATIONS, Proof analysis in intermediate logics, A note on admissible rules and the disjunction property in intermediate logics, The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\), Canonical rules, Rules with parameters in modal logic. I.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intermediate logics and Visser's rules
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- On two problems of Harvey Friedman
- Constructivism in mathematics. An introduction. Volume II
- Admissibility of logical inference rules
- All intermediate logics with extra axioms in one variable, except eight, are not strongly ω-complete
- 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
- Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
- On formulas of one variable in intuitionistic propositional calculus
- 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 partial analysis of modified realizability
- Propositional Calculus and Realizability
- Rules and arithmetics
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
- A(nother) characterization of intuitionistic propositional logic
