2017/01/18 by Mojtaba Aghaei, Aghaei, Mojtaba, Maryam Rostamigiv +1
Computer Science · #03B47 #03D15 #FOS: Computer and information sciences #FOS: Mathematics #Formal Methods in Verification #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.1701.05138
openalex publication_date 2017/01/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Several methods for checking admissibility of rules in the modal logic S4 are presented in [1], [15]. These methods determine admissibility of rules in S4, but they don't determine or give substitutions rejecting inadmissible rules. In this paper, we investigate some relations between one of the above methods, based on the reduced normal form rules, and sets of substitutions which reject them. We also generalize the method in [1], [15] for one rule to admissibility of a set of rules.