首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7506篇
  免费   403篇
  国内免费   4篇
  2023年   90篇
  2022年   132篇
  2021年   167篇
  2020年   232篇
  2019年   207篇
  2018年   394篇
  2017年   386篇
  2016年   342篇
  2015年   209篇
  2014年   256篇
  2013年   995篇
  2012年   561篇
  2011年   558篇
  2010年   351篇
  2009年   218篇
  2008年   449篇
  2007年   359篇
  2006年   314篇
  2005年   258篇
  2004年   174篇
  2003年   178篇
  2002年   155篇
  2001年   80篇
  2000年   105篇
  1999年   59篇
  1998年   38篇
  1997年   31篇
  1996年   26篇
  1995年   24篇
  1994年   19篇
  1993年   27篇
  1992年   35篇
  1991年   36篇
  1990年   31篇
  1989年   31篇
  1988年   34篇
  1987年   22篇
  1986年   16篇
  1985年   22篇
  1984年   21篇
  1983年   14篇
  1979年   20篇
  1976年   14篇
  1972年   14篇
  1971年   16篇
  1970年   12篇
  1969年   12篇
  1968年   17篇
  1966年   16篇
  1965年   16篇
排序方式: 共有7913条查询结果,搜索用时 15 毫秒
71.
72.
Subjects were presented with briefly exposed visual displays of words that were common first names with a length of four to six letters. In the main experiment, each display consisted of four words: two names shown in red and two shown in white. The subject’s task was to report the red names (targets), but ignore the white ones (distractors). On some trials the subject’s own name appeared as a display item (target or distractor). Presentation of the subject’s name as a distractor caused no more interference with report of targets than did presentation of other names as distractors. Apparently, visual attention was not automatically attracted by the subject’s own name.  相似文献   
73.
74.
Hájek  Petr 《Studia Logica》1997,58(1):129-141
A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined.  相似文献   
75.
76.
77.
78.
79.
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  相似文献   
80.
The purpose of this paper is to evaluate the significance of the existential notion of authenticity for medical ethics. This is done by analyzing authenticity and examining its implications for the patient-professional relationship and for ethical decision-making in medical situations. It is argued that while authenticity implies important demand for individual responsibility, which has therapeutic significance, it perpetuates ideas which are antithetical both to authentic interaction between patients and professionals and to fruitful deliberation of moral dilemmas. In order to counteract these consequences, an alternative idea of authenticity is introduced. According to this idea, authenticity is not regarded primarily as individual sovereignty, but as an ability to participate in a dialogue in which the subjectivity of both partners is respected. Such practice, based on mutual trust and responsibility, would enhance common decision-making and overcome the alienation between patients and professionals.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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