共查询到20条相似文献,搜索用时 0 毫秒
1.
I. L. Humberstone 《Studia Logica》1990,49(2):197-214
We illustrate, with three examples, the interaction between boolean and modal connectives by looking at the role of truth-functional reasoning in the provision of completeness proofs for normal modal logics. The first example (§ 1) is of a logic (more accurately: range of logics) which is incomplete in the sense of being determined by no class of Kripke frames, where the incompleteness is entirely due to the lack of boolean negation amongst the underlying non-modal connectives. The second example (§ 2) focusses on the breakdown, in the absence of boolean disjunction, of the usual canonical model argument for the logic of dense Kripke frames, though a proof of incompleteness with respect to the Kripke semantics is not offered. An alternative semantic account is developed, in terms of which a completeness proof can be given, and this is used (§ 3) in the discussion of the third example, a bimodal logic which is, as with the first example, provably incomplete in terms of the Kripke semantics, the incompleteness being due to the lack of disjunction (as a primitive or defined boolean connective). 相似文献
2.
J. F. A. K. van Benthem 《Studia Logica》1980,39(2-3):125-141
In the modal literature various notions of completeness have been studied for normal modal logics. Four of these are defined here, viz. (plain) completeness, first-order completeness, canonicity and possession of the finite model property — and their connections are studied. Up to one important exception, all possible inclusion relations are either proved or disproved. Hopefully, this helps to establish some order in the jungle of concepts concerning modal logics. In the course of the exposition, the interesting properties of first-order definability and preservation under ultrafilter extensions are introduced and studied as well. 相似文献
3.
Paolo Gentilini 《Studia Logica》1993,52(4):549-564
In this paper the PA-completeness of modal logic is studied by syntactical and constructive methods. The main results are theorems on the structure of the PA-proofs of suitable arithmetical interpretationsS
of a modal sequentS, which allow the transformation of PA-proofs ofS
into proof-trees similar to modal proof-trees. As an application of such theorems, a proof of Solovay's theorem on arithmetical completeness of the modal system G is presented for the class of modal sequents of Boolean combinations of formulas of the form p
i,m
i=0, 1, 2, ... The paper is the preliminary step for a forthcoming global syntactical resolution of the PA-completeness problem for modal logic. 相似文献
4.
This paper extends David Lewis result that all first degree modal logics are complete to weakly aggregative modal logic by providing a filtration-theoretic version of the canonical model construction of Apostoli and Brown. The completeness and decidability of all first-degree weakly aggregative modal logics is obtained, with Lewiss result for Kripkean logics recovered in the case k=1. 相似文献
5.
6.
7.
8.
Michal Grabowski 《Studia Logica》1988,47(3):213-220
In this paper we study the status of the arithmetical completeness of dynamic logic. We prove that for finitistic proof systems for dynamic logic results beyond arithmetical completeness are very unlikely. The role of the set of natural numbers is carefully analyzed. 相似文献
9.
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points FOμ. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid μ-calculus. In particular, we prove that the recursive extension of SQEMA succeeds on the class of ‘recursive formulae’. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds. 相似文献
10.
Hybrid completeness 总被引:2,自引:0,他引:2
11.
Wojciech Buszkowski 《Studia Logica》1989,48(1):23-34
Some notions of the logic of questions (presupposition of a question, validation, entailment) are used for defining certain kinds of completeness of elementary theories. Presuppositional completeness, closely related to -completeness ([3], [6]), is shown to be fulfilled by strong elementary theories like Peano arithmetic. 相似文献
12.
《Occupational Therapy in Mental Health》2013,29(4):21-26
No abstract available for this article. 相似文献
13.
Illusions in modal reasoning 总被引:1,自引:0,他引:1
According to the mental model theory, models represent what is true, but not what is false. One unexpected consequence is that certain inferences should have compelling, but invalid, conclusions. Three experiments corroborated the occurrence of such illusions in reasoning about possibilities. When problems had the heading "Only one of the premises is true," the participants considered the truth of each premise in turn, but neglected the fact that when one premise is true, the others are false. When two-premise problems had the heading "One of the premises is true and one is false," the participants still neglected the falsity of one of the premises. As predicted, however, the illusions were reduced when reasoners were told to check their conclusions against the constraint that only one of the premises was true. We discuss alternative explanations for illusory inferences and their implications for current theories of reasoning. 相似文献
14.
Harry Deutsch 《Studia Logica》1979,38(2):137-147
The subsystem S of Parry's AI [10] (obtained by omitting modus ponens for the material conditional) is axiomatized and shown to be strongly complete for a class of three valued Kripke style models. It is proved that S is weakly complete for the class of consistent models, and therefore that Ackermann's rule is admissible in S. It also happens that S is decidable and contains the Lewis system S4 on translation — though these results are not presented here. S is arguably the most relevant relevant logic known at this time to be decidable.I wish to thank Jill Pipher and Professora Nuel D. Belnap, Jr. and David Kaplan for their helpful comments on an earlier version of this paper. 相似文献
15.
Marcus Hutter John W. Lloyd Kee Siong Ng William T.B. Uther 《Journal of Applied Logic》2013,11(4):386-420
Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive languages like higher-order logic are ideally suited for representing and reasoning about structured knowledge. Uncertain knowledge can be modeled by using graded probabilities rather than binary truth values. The main technical problem studied in this paper is the following: Given a set of sentences, each having some probability of being true, what probability should be ascribed to other (query) sentences? A natural wish-list, among others, is that the probability distribution (i) is consistent with the knowledge base, (ii) allows for a consistent inference procedure and in particular (iii) reduces to deductive logic in the limit of probabilities being 0 and 1, (iv) allows (Bayesian) inductive reasoning and (v) learning in the limit and in particular (vi) allows confirmation of universally quantified hypotheses/sentences. We translate this wish-list into technical requirements for a prior probability and show that probabilities satisfying all our criteria exist. We also give explicit constructions and several general characterizations of probabilities that satisfy some or all of the criteria and various (counter)examples. We also derive necessary and sufficient conditions for extending beliefs about finitely many sentences to suitable probabilities over all sentences, and in particular least dogmatic or least biased ones. We conclude with a brief outlook on how the developed theory might be used and approximated in autonomous reasoning agents. Our theory is a step towards a globally consistent and empirically satisfactory unification of probability and logic. 相似文献
16.
Carroll C. Pratt 《The Journal of psychology》2013,147(1):149-156
A sample of 128 Ss differing in flying experience were compared in their travel preferences and in their drawings of airplanes. Significant sex differences were found, with males drawing more “realistic” airplanes; and females, larger airplanes. Those males who had flown and who indicated motion in their drawings tended to report some experience of motion sickness. Those females who had flown and who indicated motion in their drawings tended to report fear of high places. 相似文献
17.
Valentin Goranko 《Studia Logica》1994,53(2):299-324
Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.Presented byJan Zygmunt 相似文献
18.
19.
《Journal of Applied Logic》2014,12(4):570-583
One of natural combinations of Kripke complete modal logics is the product, an operation that has been extensively investigated over the last 15 years. In this paper we consider its analogue for arbitrary modal logics: to this end, we use product-like constructions on general frames and modal algebras. This operation was first introduced by Y. Hasimoto in 2000; however, his paper remained unnoticed until recently. In the present paper we quote some important Hasimoto's results, and reconstruct the product operation in an algebraic setting: the Boolean part of the resulting modal algebra is exactly the tensor product of original algebras (regarded as Boolean rings). Also, we propose a filtration technique for Kripke models based on tensor products and obtain some decidability results. 相似文献
20.