首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1053篇
  免费   42篇
  1095篇
  2021年   13篇
  2020年   17篇
  2019年   16篇
  2018年   31篇
  2017年   30篇
  2016年   32篇
  2015年   21篇
  2014年   30篇
  2013年   125篇
  2012年   43篇
  2011年   47篇
  2010年   39篇
  2009年   38篇
  2008年   44篇
  2007年   36篇
  2006年   34篇
  2005年   23篇
  2004年   34篇
  2003年   29篇
  2002年   17篇
  2001年   15篇
  2000年   16篇
  1999年   16篇
  1998年   13篇
  1997年   8篇
  1996年   15篇
  1995年   11篇
  1992年   11篇
  1991年   13篇
  1990年   7篇
  1989年   12篇
  1988年   6篇
  1987年   9篇
  1986年   7篇
  1985年   15篇
  1983年   12篇
  1982年   14篇
  1981年   7篇
  1980年   6篇
  1978年   9篇
  1977年   9篇
  1976年   15篇
  1975年   6篇
  1974年   6篇
  1973年   6篇
  1972年   18篇
  1970年   6篇
  1966年   5篇
  1935年   9篇
  1931年   5篇
排序方式: 共有1095条查询结果,搜索用时 0 毫秒
101.
Logical geometry systematically studies Aristotelian diagrams, such as the classical square of oppositions and its extensions. These investigations rely heavily on the use of bitstrings, which are compact combinatorial representations of formulas that allow us to quickly determine their Aristotelian relations. However, because of their general nature, bitstrings can be applied to a wide variety of topics in philosophical logic beyond those of logical geometry. Hence, the main aim of this paper is to present a systematic technique for assigning bitstrings to arbitrary finite fragments of formulas in arbitrary logical systems, and to study the logical and combinatorial properties of this technique. It is based on the partition of logical space that is induced by a given fragment, and sheds new light on a number of interesting issues, such as the logic-dependence of the Aristotelian relations and the subtle interplay between the Aristotelian and Boolean structure of logical fragments. Finally, the bitstring technique also allows us to systematically analyze fragments from contemporary logical systems, such as public announcement logic, which could not be done before.  相似文献   
102.
103.
104.
105.
This study presents a model of psychic change in personality disorders focusing on three dimensions: felt safety, mentalization and self‐object relations. Based upon this model a hospitalization‐based therapy program was created. Four scales to measure these three dimensions on the Object Relation Interview are discussed: the Felt Safety Scale, the Reflective Functioning Scale and the Bion Grid Scale and the Differentiation‐Relatedness Scale. A naturalistic symptom outcome study of the program showed a large effect on both symptoms and personality functioning. Furthermore, trajectory based on pre‐treatment patient characteristics (i.e., anaclitic versus introjective personality styles). Importantly, we also found a relation between symptomatic and personality change and change in felt safety and object relations. At 5‐year follow‐up, patients showed sustained improvement in symptomatic distress and further improvement in terms of personality and interpersonal functioning.  相似文献   
106.
The Asymptotic Classification Theory of Cognitive Diagnosis (Chiu et al., 2009, Psychometrika, 74, 633–665) determined the conditions that cognitive diagnosis models must satisfy so that the correct assignment of examinees to proficiency classes is guaranteed when non‐parametric classification methods are used. These conditions have only been proven for the Deterministic Input Noisy Output AND gate model. For other cognitive diagnosis models, no theoretical legitimization exists for using non‐parametric classification techniques for assigning examinees to proficiency classes. The specific statistical properties of different cognitive diagnosis models require tailored proofs of the conditions of the Asymptotic Classification Theory of Cognitive Diagnosis for each individual model – a tedious undertaking in light of the numerous models presented in the literature. In this paper a different way is presented to address this task. The unified mathematical framework of general cognitive diagnosis models is used as a theoretical basis for a general proof that under mild regularity conditions any cognitive diagnosis model is covered by the Asymptotic Classification Theory of Cognitive Diagnosis.  相似文献   
107.
108.
109.
    
Ohne Zusammenfassung  相似文献   
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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