On rules
From MaRDI portal
Publication:266650
DOI10.1007/S10992-015-9354-XzbMath1336.03037DBLPjournals/jphil/Iemhoff15OpenAlexW4251128080WikidataQ59427148 ScholiaQ59427148MaRDI QIDQ266650
Publication date: 13 April 2016
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10992-015-9354-x
Related Items (9)
Almost structural completeness; an algebraic approach ⋮ A syntactic approach to unification in transitive reflexive modal logics ⋮ Consequence relations and admissible rules ⋮ Logic Discovered and Logic Imposed (A Purim Story) ⋮ Complexity of the universal theory of residuated ordered groupoids ⋮ PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS ⋮ Computational complexity for bounded distributive lattices with negation ⋮ Deductive systems with multiple-conclusion rules and the disjunction property ⋮ Complexity of the universal theory of modal algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A syntactic approach to unification in transitive reflexive modal logics
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- On unification and admissible rules in Gabbay-de Jongh logics
- Intermediate logics and Visser's rules
- Unification, finite duality and projectivity in varieties of Heyting algebras
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Admissible rules in the implication-negation fragment of intuitionistic logic
- A structurally complete fragment of relevant logic
- Complexity of admissible rules
- Proof theory for admissible rules
- Structural completeness in fuzzy logics
- On two problems of Harvey Friedman
- An alternative rule of disjunction in modal logic
- Theory of logical calculi. Basic theory of consequence operations
- Admissibility of logical inference rules
- Some admissible rules in nonnormal modal systems
- Best solving modal equations
- Decidable modal logic with undecidable admissibility problem
- On the structural completeness of some pure implicational propositional calculi
- On the admissible rules of intuitionistic propositional logic
- Linear Temporal Logic LTL: Basis for Admissible Rules
- Bases of Admissible Rules of Lukasiewicz Logic
- Algebraic semantics for the (↔, ¬¬)-fragment of IPC
- A Resolution/Tableaux Algorithm for Projective Approximations in IPC
- Writing out Unifiers in Linear Temporal Logic
- UNIFICATION IN INTERMEDIATE LOGICS
- MODAL COMPANIONS OF SUPERINTUITIONISTIC LOGICS: SYNTAX, SEMANTICS, AND PRESERVATION THEOREMS
- Independent Bases of Admissible Rules
- Structural Completeness in Substructural Logics
- Admissible Rules of Lukasiewicz Logic
- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
- Canonical rules
- Canonical formulas for K4. Part I: Basic results
- Structural completeness of the first‐order predicate calculus
- Unification in intuitionistic logic
- Canonical formulas for K4. Part III: the finite model property
- Canonical formulas for K4. Part II: Cofinal subframe logics
- Undecidability of the unification and admissibility problems for modal and description logics
- Admissible Rules of Modal Logics
- Rules and arithmetics
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
This page was built for publication: On rules
