Tutorial on Admissible Rules in Gudauri
From MaRDI portal
Publication:3455180
DOI10.1007/978-3-662-46906-4_2zbMath1326.03002OpenAlexW1021855167MaRDI QIDQ3455180
Publication date: 3 December 2015
Published in: Logic, Language, and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46906-4_2
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Decidability of theories and sets of sentences (03B25) Abstract deductive systems (03B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Simple consequence relations
- Complexity of admissible rules
- Proof theory for admissible rules
- An alternative rule of disjunction in modal logic
- Structural completeness of Gödel's and Dummett's propositional calculi
- Admissibility of logical inference rules
- Decidable modal logic with undecidable admissibility problem
- On the structural completeness of some pure implicational propositional calculi
- Linear Temporal Logic LTL: Basis for Admissible Rules
- Algebraic semantics for the (↔, ¬¬)-fragment of IPC
- A Resolution/Tableaux Algorithm for Projective Approximations in IPC
- Writing out Unifiers in Linear Temporal Logic
- Blending margins: the modal logic K has nullary unification type
- UNIFICATION IN INTERMEDIATE LOGICS
- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
- Structural completeness of the first‐order predicate calculus
- Unification in intuitionistic logic
- 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
