首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7519篇
  免费   382篇
  国内免费   5篇
  2024年   15篇
  2023年   90篇
  2022年   129篇
  2021年   169篇
  2020年   206篇
  2019年   212篇
  2018年   419篇
  2017年   381篇
  2016年   339篇
  2015年   212篇
  2014年   250篇
  2013年   971篇
  2012年   531篇
  2011年   545篇
  2010年   360篇
  2009年   219篇
  2008年   430篇
  2007年   359篇
  2006年   317篇
  2005年   285篇
  2004年   186篇
  2003年   181篇
  2002年   160篇
  2001年   80篇
  2000年   106篇
  1999年   76篇
  1998年   38篇
  1997年   33篇
  1996年   28篇
  1995年   23篇
  1994年   27篇
  1993年   26篇
  1992年   41篇
  1991年   23篇
  1990年   28篇
  1989年   30篇
  1988年   28篇
  1987年   24篇
  1985年   20篇
  1984年   19篇
  1983年   13篇
  1979年   17篇
  1976年   17篇
  1974年   16篇
  1973年   17篇
  1972年   14篇
  1971年   18篇
  1968年   22篇
  1966年   13篇
  1965年   14篇
排序方式: 共有7906条查询结果,搜索用时 31 毫秒
71.
72.
73.
74.
Per-erik Malmnäs 《Synthese》1994,99(2):233-249
It is argued that existing axiomatic theories of utility do not provide the utility principle or the principle of maximising expected utility with a formal justification. It is also argued that these theories only put mild constraints on a decision-maker in a decision-context. Finally, it is argued that the prospects are not particularly bright for finding formal non-circular arguments for the utility principle that do not rely on the law of large numbers.  相似文献   
75.
Rajeev Goré 《Studia Logica》1994,53(3):433-457
We present sound, (weakly) complete and cut-free tableau systems for the propositional normal modal logicsS4.3, S4.3.1 andS4.14. When the modality is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of points; and as a branching tree where each branch is a linear discrete sequence of points.Although cut-free, the last two systems do not possess the subformula property. But for any given finite set of formulaeX the superformulae involved are always bounded by a finite set of formulaeX* L depending only onX and the logicL. Thus each system gives a nondeterministic decision procedure for the logic in question. The completeness proofs yield deterministic decision procedures for each logic because each proof is constructive.Each tableau system has a cut-free sequent analogue proving that Gentzen's cut-elimination theorem holds for these latter systems. The techniques are due to Hintikka and Rautenberg.Presented byDov M. Gabbay  相似文献   
76.
Angular induction is the process by which one line segment can bias judgment of orientation and/or collinearity of another segment, and it has been established that the magnitude of error is a determinate function of the relative angle between the two. We examined how these known relationships are affected by decomposing the induction segment into an array of scattered points. The bias that was produced by such arrays was found to be consistent with a formal model of angular induction, with the strength of the effect decreasing as the scatter among the points was increased. This decline in strength was almost linear with a logarithmic transform of the dimensions of the stimulus array. We also evaluated the hypothesis that the induction stimulus is detected by one or more channels—for example, neurons—for which the sensitivity profiles are modeled as Gabor wavelets. The change in induction strength with increasing point scatter was not predicted by a single width of channel. However, the combined activity of an ensemble of channels that differed in width did match the perceptual effects if one also stipulated that each channel would respond maximally to a fine-line stimulus.  相似文献   
77.
Effects of the similarity between target and distractors in a visual search task were investigated in several experiments. Both familiar (numerals and letters) and unfamiliar (connected figures in a 5 × 5 matrix) stimuli were used. The observer had to report on the presence or absence of a target among a variable number of homogeneous distractors as fast and as accurately as possible. It was found that physical difference had the same clear effect on processing time far familiar and for unfamiliar stimuli: processing time decreased monotonically with increasing physical difference. Distractors unrelated to the target and those related to the target by a simple transformation (180° rotation, horizontal or vertical reflection) were also compared, while the physical difference was kept constant. For familiar stimuli, transformational relatedness increased processing time in comparison with that fort unrelated stimulus pairs. It was further shown in a scaling experiment that this effect could be accounted for by the amount of perceived similarity of the target-distractor pairs. For unfamiliar stimuli, transformational relatedness did have a smaller and less pronounced effect. Various comparable unrelated distractors resulted in a full range of processing times. Results from a similarity scaling experiment correlated well with the outcome of the experiments with unfamiliar stimuli. These results are interpreted in terms of an underlying continuum of perceived similarity as the basis of the speed of visual search, rather than a dichotomy of parallel versus serial processing.  相似文献   
78.
79.
80.
The purpose of the paper is to present a logical framework that allow to formalize a kind of prima facie duties, defeasible conditional duties, indefeasible conditional duties and actual (indefeasible) duties, as well as to show their logical interconnections.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号