全文获取类型
收费全文 | 188篇 |
免费 | 6篇 |
国内免费 | 3篇 |
出版年
2022年 | 1篇 |
2021年 | 7篇 |
2020年 | 4篇 |
2019年 | 1篇 |
2018年 | 4篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 16篇 |
2012年 | 5篇 |
2011年 | 9篇 |
2010年 | 3篇 |
2009年 | 17篇 |
2008年 | 22篇 |
2007年 | 17篇 |
2006年 | 9篇 |
2005年 | 12篇 |
2004年 | 11篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 9篇 |
1998年 | 5篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有197条查询结果,搜索用时 15 毫秒
141.
142.
143.
144.
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics is the logic of Bunched Implications due to Pym and O’Hearn, which combines intuitionistic and multiplicative connectives. This introduces several new connectives not previously considered in logics of informational dependence, but which we show play a very natural rôle, most notably intuitionistic implication. As regards the quantifiers, we show that their interpretation in the Hodges semantics is forced, in that they are the image under the general construction of the usual Tarski semantics; this implies that they are adjoints to substitution, and hence uniquely determined. As for the dependence predicate, we show that this is definable from a simpler predicate, of constancy or dependence on nothing. This makes essential use of the intuitionistic implication. The Armstrong axioms for functional dependence are then recovered as a standard set of axioms for intuitionistic implication. We also prove a full abstraction result in the style of Hodges, in which the intuitionistic implication plays a very natural rôle. 相似文献
145.
Constraint Handling Rules (CHR) is an extension to Prolog which opens up a spectrum of hypothesis-based reasoning in logic programs without additional interpretation overhead. Abduction with integrity constraints is one example of hypothesis-based reasoning which can be implemented directly in Prolog and CHR with a straightforward use of available and efficiently implemented facilities.The present paper clarifies the semantic foundations for this way of doing abduction in CHR and Prolog as well as other examples of hypothesis-based reasoning that is possible, including assumptive logic programming, hypotheses with priority and scope, and nonmonotonic reasoning.Examples are presented as executable code so the paper may also serve the additional purpose of a practical guide for developing such programs, and it is demonstrated that the approach provides a seamless integration with existing constraint solvers. 相似文献
146.
小学儿童互选友谊的发展趋势及攻击行为的影响:3年追踪研究 总被引:1,自引:0,他引:1
对小学3、4年级的285名儿童进行了3年追踪调查,分析了儿童分别与男、女生互选友谊数的变化趋势及其在个体间的差异,探讨了外部攻击和关系攻击分别对两类互选友谊数的影响。结果表明:(1)儿童的男、女生互选友谊数在3年时间内都有显著的增加趋势,并表现出显著的性别差异,儿童与同性互选友谊数显著多于他们与异性的互选友谊数,男生与女生互选友谊数的增加速度比女生与女生互选友谊数增加速度慢,儿童与男生的互选友谊数越多,他/她与女生的互选友谊数就越少,表明了性别隔离现象的存在。(2)在控制了关系攻击的影响后,儿童的外部攻击对他们在各时间点测得的与女生的互选友谊数有显著的消极影响,而对他们与男生的互选友谊数影响不显著;在控制了外部攻击的影响后,儿童的关系攻击对他们在各时间点测得的与女生的互选友谊数有显著的积极影响,而对他们与男生的互选友谊数影响不显著。这说明外部攻击和关系攻击对儿童互选友谊数的影响存在性别差异 相似文献
147.
Eric Pacuit 《Studia Logica》2007,86(3):435-454
Adam Brandenburger and H. Jerome Keisler have recently discovered a two person Russell-style paradox. They show that the following
configurations of beliefs is impossible: Ann believes that Bob assumes that Ann believes that Bob’s assumption is wrong. In [7] a modal logic interpretation of this paradox is proposed. The idea is to introduce two modal operators intended to
represent the agents’ beliefs and assumptions. The goal of this paper is to take this analysis further and study this paradox from the point of view of a modal logician.
In particular, we show that the paradox can be seen as a theorem of an appropriate hybrid logic.
Special Issue Formal Epistemology II. Edited by Branden Fitelson 相似文献
148.
Natan Berber 《Axiomathes》2007,17(2):185-196
This paper focuses on the relation between logic and ontology. In particular, it demonstrates how classical logical theory
can clarify the ontological part of Ludwig Wittgenstein’s Tractatus Logico-Philosophicus. To this end, the work examines the adequacy of a formal system that was devised by the Polish logician, mathematician and
philosopher Roman Suszko (1919–1979) as a model for the Tractatus. Following a brief explanation of the Tractarian ontology, the main ideas of Suszko’s system and its philosophical significance
will be considered. The latter will be illustrated in the context of central Tractarian concepts. Finally, two implications
for a better understanding of the Tractarian ontology will be pointed out.
相似文献
Natan BerberEmail: |
149.
Employing a logic program approach, this paper focuses on applying preferential reasoning to theory revision, both by means of preferences among existing theory rules, and by means of preferences on the possible abductive extensions to the theory. And, in particular, how to prefer among plausible abductive explanations justifying observations. 相似文献
150.