Inference rules with metavariables and logical equations in the pretabular modal logic PM1

2000 ◽  
Vol 41 (1) ◽  
pp. 74-80 ◽  
Author(s):  
V. R. Kiyatkin
Keyword(s):  
Modal Logic ◽  
Inference Rules

scholarly journals Meta-inferences and Supervaluationism

2021 ◽  
Author(s):  
Luca Incurvati ◽  
Julian J. Schlöder
Keyword(s):  
Modal Logic ◽  
Deductive Reasoning ◽  
Higher Order ◽  
Proof System ◽  
Inference Rules ◽  
Consequence Relation ◽  
Normal Modal Logic ◽  
First Order ◽  
Truth Value ◽  
Crucial Ingredient

AbstractMany classically valid meta-inferences fail in a standard supervaluationist framework. This allegedly prevents supervaluationism from offering an account of good deductive reasoning. We provide a proof system for supervaluationist logic which includes supervaluationistically acceptable versions of the classical meta-inferences. The proof system emerges naturally by thinking of truth as licensing assertion, falsity as licensing negative assertion and lack of truth-value as licensing rejection and weak assertion. Moreover, the proof system respects well-known criteria for the admissibility of inference rules. Thus, supervaluationists can provide an account of good deductive reasoning. Our proof system moreover brings to light how one can revise the standard supervaluationist framework to make room for higher-order vagueness. We prove that the resulting logic is sound and complete with respect to the consequence relation that preserves truth in a model of the non-normal modal logic NT. Finally, we extend our approach to a first-order setting and show that supervaluationism can treat vagueness in the same way at every order. The failure of conditional proof and other meta-inferences is a crucial ingredient in this treatment and hence should be embraced, not lamented.

scholarly journals Admissible Inference Rules and Semantic Property of Modal Logics

2021 ◽  
Vol 37 ◽  
pp. 104-117
Author(s):  
V.V. Rimatskiy ◽  
Keyword(s):  
Modal Logic ◽  
Inference Rule ◽  
Expressive Power ◽  
Modal Logics ◽  
Human Reasoning ◽  
Inference Rules ◽  
Semantic Property ◽  
Admissible Rule ◽  
Admissible Inference Rules ◽  
Deductive Power

Firstly semantic property of nonstandart logics were described by formulas which are peculiar to studied a models in general, and do not take to consideration a variable conditions and a changing assumptions. Evidently the notion of inference rule generalizes the notion of formulas and brings us more flexibility and more expressive power to model human reasoning and computing. In 2000-2010 a few results on describing of explicit bases for admissible inference rules for nonstandard logics (S4, K4, H etc.) appeared. The key property of these logics was weak co-cover property. Beside the improvement of deductive power in logic, an admissible rule are able to describe some semantic property of given logic. We describe a semantic property of modal logics in term of admissibility of given set of inference rules. We prove that modal logic over logic 𝐺𝐿 enjoys weak co-cover property iff all given rules are admissible for logic.

scholarly journals Efficient loop-check for multimodal KD45n logic

2021 ◽  
Vol 47 ◽  
Author(s):  
Adomas Birštunas
Keyword(s):  
Modal Logic ◽  
Sequent Calculus ◽  
Space Complexity ◽  
Maximum Height ◽  
Polynomial Space ◽  
Inference Rules ◽  
Derivation Tree ◽  
Modal Operator

We introduce sequent calculus for multi-modal logic KD45n which uses efficient loop-check. Efficiency of the used loop-check is obtained by using marked modal operator squarei which is used as an alternative to sequent with histories ([2,3]).We use inference rules with or branches to make all rules invertible or semi-invertible. We showthe maximum height of the constructed derivation tree.  Also polynomial space complexity is proved.

Aristotle's modal logic

1995 ◽  
Author(s):  
Richard Patterson
Keyword(s):  
Modal Logic

Modal Logic

1980 ◽  
Author(s):  
Brian F. Chellas
Keyword(s):  
Modal Logic

Explanatory Power for Medical Expert Systems: Studies in the Representation of Causal Relationships for Clinical Consultations

1982 ◽  
Vol 21 (03) ◽  
pp. 127-136 ◽  
Author(s):  
J. W. Wallis ◽  
E. H. Shortliffe
Keyword(s):  
Explanatory Power ◽  
Prototype System ◽  
Inference Rules ◽  
Medical Expert ◽  
Comprehensive Knowledge ◽  
Different Types ◽  
Medical Expert Systems ◽  
Explanation System ◽  
Systems Studies

This paper reports on experiments designed to identify and implement mechanisms for enhancing the explanation capabilities of reasoning programs for medical consultation. The goals of an explanation system are discussed, as is the additional knowledge needed to meet these goals in a medical domain. We have focussed on the generation of explanations that are appropriate for different types of system users. This task requires a knowledge of what is complex and what is important; it is further strengthened by a classification of the associations or causal mechanisms inherent in the inference rules. A causal representation can also be used to aid in refining a comprehensive knowledge base so that the reasoning and explanations are more adequate. We describe a prototype system which reasons from causal inference rules and generates explanations that are appropriate for the user.

Sign in / Sign up

Export Citation Format

Share Document