Tutorial on Admissible Rules in Gudauri (Q3455180)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Tutorial on Admissible Rules in Gudauri	scientific article

Statements

scholarly article

0 references

Tutorial on Admissible Rules in Gudauri (English)

0 references

Rosalie Iemhoff

0 references

Logic, Language, and Computation

0 references

publication date

3 December 2015

0 references

zbMATH Keywords

logic

0 references

admissible rules

0 references

consequence relations

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-46906-4_2

0 references

Simple consequence relations

0 references

Linear Temporal Logic LTL: Basis for Admissible Rules

0 references

Decidable modal logic with undecidable admissibility problem

0 references

Admissible rules in the implication-negation fragment of intuitionistic logic

0 references

Structural completeness of Gödel's and Dummett's propositional calculi

0 references

Unification in intuitionistic logic

0 references

A Resolution/Tableaux Algorithm for Projective Approximations in IPC

0 references

Unification, finite duality and projectivity in varieties of Heyting algebras

0 references

On unification and admissible rules in Gabbay-de Jongh logics

0 references

Intermediate logics and Visser's rules

0 references

Proof theory for admissible rules

0 references

Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics

0 references

UNIFICATION IN INTERMEDIATE LOGICS

0 references

Admissible Rules of Modal Logics

0 references

Complexity of admissible rules

0 references

Blending margins: the modal logic K has nullary unification type

0 references

0 references

Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)

0 references

0 references

Structural completeness of the first‐order predicate calculus

0 references

On the structural completeness of some pure implicational propositional calculi

0 references

0 references

Admissibility of logical inference rules

0 references

Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition

0 references

Writing out Unifiers in Linear Temporal Logic

0 references

0 references

A structurally complete fragment of relevant logic

0 references

Algebraic semantics for the (↔, ¬¬)-fragment of IPC

0 references

Rules and arithmetics

0 references

Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic

0 references

An alternative rule of disjunction in modal logic

0 references

0 references

Undecidability of the unification and admissibility problems for modal and description logics

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-46906-4_2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3455180

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3455180&oldid=36216359"