Tabular Logics with no Finite Bases for Inference Rules

DOI10.1093/JIGPAL/12.4.301MaRDI QIDQ4659578zbMATH OpenOpenAlexFDO

Authors Vladimir Rybakov

Publication date 21 March 2005

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/12.4.301

zbMATH Keywords

finite baseinference rulesnonstandard logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Intermediate logics (03B55)

Recommendations

• Tableaux for nonmonotonic logics
• scientific article; zbMATH DE number 1189102
• Tableaux for intuitionistic logics
• Tableaux for Łukasiewicz infinite-valued logic
• Bases of admissible inference rules in tabular modal logics of depth 2
• Not every ``tabular predicate logic is finitely axiomatizable
• The tabularity problem over the minimal logic
• Tableaux for many-valued logics
• Explicit basis for admissible rules in K-saturated tabular logics
• scientific article; zbMATH DE number 1333598

Cited in

(2)

• Not every ``tabular predicate logic is finitely axiomatizable
• DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV

This page was built for publication: Tabular Logics with no Finite Bases for Inference Rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4659578)