全文获取类型
收费全文 | 941篇 |
免费 | 16篇 |
国内免费 | 2篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 11篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 36篇 |
2015年 | 9篇 |
2014年 | 22篇 |
2013年 | 49篇 |
2012年 | 5篇 |
2011年 | 7篇 |
2010年 | 9篇 |
2009年 | 55篇 |
2008年 | 79篇 |
2007年 | 75篇 |
2006年 | 60篇 |
2005年 | 71篇 |
2004年 | 55篇 |
2003年 | 57篇 |
2002年 | 58篇 |
2001年 | 39篇 |
2000年 | 58篇 |
1999年 | 38篇 |
1998年 | 32篇 |
1997年 | 33篇 |
1996年 | 21篇 |
1995年 | 20篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
排序方式: 共有959条查询结果,搜索用时 15 毫秒
161.
Riccardo Franco 《Journal of mathematical psychology》2009,53(5):415-64
In the present article we consider the conjunction fallacy, a well known cognitive fallacy experimentally tested in cognitive science, which occurs for intuitive judgments. We show that the quantum formalism can be used to describe, in a very simple way, this fallacy, in terms of interference effect. We provide evidence that the quantum formalism leads quite naturally to violations of the joint probability rule of classic probability when considering the estimated probability of the conjunction of two events. By defining the concept of maximal conjunction error, we find a good agreement with experimental results. Thus we suggest that in cognitive science the formalism of quantum mechanics can be used to describe a quantum regime, where the cognitive fallacies and heuristics are valid. 相似文献
162.
Projective expected utility 总被引:1,自引:0,他引:1
Pierfrancesco La Mura 《Journal of mathematical psychology》2009,53(5):408-414
Motivated by several classic decision-theoretic paradoxes, and by analogies with the paradoxes which in physics motivated the development of quantum mechanics, we introduce a projective generalization of expected utility along the lines of the quantum-mechanical generalization of probability theory. The resulting decision theory accommodates the dominant paradoxes, while retaining significant simplicity and tractability. In particular, every finite game within this larger class of preferences still has an equilibrium. 相似文献
163.
J. Acacio de Barros 《Journal of mathematical psychology》2009,53(5):306-2099
In this paper we discuss the use of quantum mechanics to model psychological experiments, starting by sharply contrasting the need of these models to use quantum mechanical nonlocality instead of contextuality. We argue that contextuality, in the form of quantum interference, is the only relevant quantum feature used. Nonlocality does not play a role in those models. Since contextuality is also present in classical models, we propose that classical systems be used to reproduce the quantum models used. We also discuss how classical interference in the brain may lead to contextual processes, and what neural mechanisms may account for it. 相似文献
164.
Standard Kripke models are inadequate to model situations of inexact knowledge with introspection, since positive and negative
introspection force the relation of epistemic indiscernibility to be transitive and euclidean. Correlatively, Williamson’s
margin for error semantics for inexact knowledge invalidates axioms 4 and 5. We present a new semantics for modal logic which
is shown to be complete for K45, without constraining the accessibility relation to be transitive or euclidean. The semantics corresponds to a system of
modular knowledge, in which iterated modalities and simple modalities are not on a par. We show how the semantics helps to
solve Williamson’s luminosity paradox, and argue that it corresponds to an integrated model of perceptual and introspective
knowledge that is psychologically more plausible than the one defended by Williamson. We formulate a generalized version of
the semantics, called token semantics, in which modalities are iteration-sensitive up to degree n and insensitive beyond n. The multi-agent version of the semantics yields a resource-sensitive logic with implications for the representation of common
knowledge in situations of bounded rationality. 相似文献
165.
Giorgi Japaridze 《Studia Logica》2009,91(1):1-24
Within the program of finding axiomatizations for various parts of computability logic, it was proven earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting’s intuitionistic
calculus. That sort of reduction permits unlimited reusage of the computational resource represented by the antecedent. An
at least equally basic and natural sort of algorithmic reduction, however, is the one that does not allow such reusage. The
present article shows that turning the logic of the first sort of reduction into the logic of the second sort of reduction
takes nothing more than just deleting the contraction rule from its Gentzen-style axiomatization. The first (Turing) sort
of interactive reduction is also shown to come in three natural versions. While those three versions are very different from
each other, their logical behaviors (in isolation) turn out to be indistinguishable, with that common behavior being precisely
captured by implicative intuitionistic logic. Among the other contributions of the present article is an informal introduction
of a series of new — finite and bounded — versions of recurrence operations and the associated reduction operations.
Presented by Robert Goldblatt 相似文献
166.
Ernst Zimmermann 《Studia Logica》2009,91(1):131-138
The paper presents predicate logical extensions of some subintuitionistic logics. Subintuitionistic logics result if conditions
of the accessibility relation in Kripke models for intuitionistic logic are dropped. The accessibility relation which interprets
implication in models for the propositional base subintuitionistic logic considered here is neither persistent on atoms, nor
reflexive, nor transitive. Strongly complete predicate logical extensions are modeled with a second accessibility relation,
which is a partial order, for the interpretation of the universal quantifier.
Presented by Melvin Fitting 相似文献
167.
Miklós Ferenczi 《Studia Logica》2009,92(1):121-135
If the language is extended by new individual variables, in classical first order logic, then the deduction system obtained
is a conservative extension of the original one. This fails to be true for the logics with infinitary predicates. But it is
shown that restricting the commutativity of quantifiers and the equality axioms in the extended system and supposing the merry-go-round
property in the original system, the foregoing extension is already conservative. It is shown that these restrictions are
crucial for an extension to be conservative. The origin of the results is algebraic logic.
Presented by Daniele Mundici
Supported by grant OTKA T43242. 相似文献
168.
Lena Kurzen 《Synthese》2009,169(2):223-240
In this paper, a logic for reasoning about coalitional power is developed which explicitly represents agents’ preferences
and the actions by which the agents can achieve certain results. A complete axiomatization is given and its satisfiability
problem is shown to be decidable and EXPTIME-hard. 相似文献
169.
研究结合数学分析方法,提出了基于非逻辑机制的条件推理模型:P-Q映射模型。并根据这个模型,对人们在不同命题类型奈件下的推理行为进行了预测。预测结果显示,当推理前提为LH和HL型命题时,基于P-Q映射模型的预测结果与基于条件概率模型的预测结果完全一致。但当推理前提为LL和HH型命题时,两种模型给出的预测结果存在差异。实验结果表明,当前提命题为LL和HH型命题时,被试的条件推理行为与P-Q映射模型的预言完全一致。 相似文献
170.
以大学生为被试,探讨认知风格与逻辑推理的关系。结果表明:(1)在三段论推理中,场依存型学生和场独立型学生推理成绩不存在显著差异,学过和未学过逻辑学的学生推理成绩也不存在显著差异,但男生和女生推理成绩差异显著,女生比男生更易受“气氛”的影响。(2)在命题推理中,对抽象材料构成的命题,场独立型学生和场依存型学生的推理存在显著差异,场独立型学生表现出更强的证伪倾向,场依存型学生表现出更强的换位倾向;对具体材料构成的命题,场独立型学生和场依存型学生的推理不存在显著差异。 相似文献