首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   487篇
  免费   36篇
  2023年   9篇
  2022年   13篇
  2021年   20篇
  2020年   20篇
  2019年   24篇
  2018年   37篇
  2017年   32篇
  2016年   41篇
  2015年   12篇
  2014年   16篇
  2013年   47篇
  2012年   13篇
  2011年   11篇
  2010年   7篇
  2009年   6篇
  2008年   9篇
  2007年   4篇
  2006年   7篇
  2005年   6篇
  2003年   4篇
  2002年   3篇
  2000年   5篇
  1999年   3篇
  1997年   6篇
  1995年   4篇
  1994年   5篇
  1993年   3篇
  1990年   6篇
  1989年   3篇
  1987年   3篇
  1986年   5篇
  1984年   3篇
  1983年   6篇
  1982年   6篇
  1981年   5篇
  1977年   3篇
  1975年   4篇
  1974年   5篇
  1973年   7篇
  1972年   3篇
  1971年   8篇
  1969年   10篇
  1968年   6篇
  1967年   5篇
  1964年   5篇
  1961年   5篇
  1960年   4篇
  1958年   12篇
  1955年   6篇
  1953年   6篇
排序方式: 共有523条查询结果,搜索用时 15 毫秒
91.
The stop-signal paradigm is a useful tool for the investigation of response inhibition. In this paradigm, subjects are instructed to respond as fast as possible to a stimulus unless a stop signal is presented after a variable delay. However, programming the stop-signal task is typically considered to be difficult. To overcome this issue, we present software called STOP-IT, for running the stop-signal task, as well as an additional analyzing program called ANALYZE-IT. The main advantage of both programs is that they are a precompiled executable, and for basic use there is no need for additional programming. STOP-IT and ANALYZE-IT are completely based on free software, are distributed under the GNU General Public License, and are available at the personal Web sites of the first two authors or at expsy.ugent.be/tscope/stop.html.  相似文献   
92.
In the current paper we consider theories with vocabulary containing a number of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations represent unique annotations of the graph’s nodes. Such theories, which we call annotation theories, can be used in many applications, including the formalization of argumentation, approximate reasoning, semantics of logic programs, graph coloring, etc. We address a number of problems related to annotation theories over finite models, including satisfiability, querying problem, specification of preferred models and model checking problem. We show that most of considered problems are NPTime- or co-NPTime-complete. In order to reduce the complexity for particular theories, we use second-order quantifier elimination. To our best knowledge none of existing methods works in the case of annotation theories. We then provide a new second-order quantifier elimination method for stratified theories, which is successful in the considered cases. The new result subsumes many other results, including those of [2, 28, 21].  相似文献   
93.
Journal of Happiness Studies - The article concentrates on regulatory focus (promotion and prevention) as a factor involved in the relationships between materialism and well-being alongside two...  相似文献   
94.
95.
96.
In the paper [2] the following theorem is shown: Theorem (Th. 3,5, [2]), If α=0 or δ= or α?δ, then a closure space X is an absolute extensor for the category of 〈α, δ〉 -closure spaces iff a contraction of X is the closure space of all 〈α, δ〉-filters in an 〈α, δ〉-semidistributive lattice. In the case when α=ω and δ=∞, this theorem becomes Scott's theorem: Theorem ([7]). A topological space X is an absolute extensor for the category of all topological spaces iff a contraction of X is a topological space of “Scott's open sets” in a continuous lattice. On the other hand, when α=0 and δ=ω, this theorem becomes Jankowski's theorem: Theorem ([4]). A closure space X is an absolute extensor for the category of all closure spaces satisfying the compactness theorem iff a contraction of X is a closure space of all filters in a complete Heyting lattice. But for separate cases of α and δ, the Theorem 3.5 from [2] is proved using essentialy different methods. In this paper it is shown that this theorem can be proved using, for retraction, one uniform formula. Namely it is proved that if α= 0 or δ= ∞ or α ? δ and \(F_{\alpha ,\delta } \left( L \right) \subseteq B_{\alpha ,\delta }^\mathfrak{n} \) and if L is an 〈α, δ〉-semidistributive lattice, then the function $$r:{\text{ }}B_{\alpha ,\delta }^\mathfrak{n} \to F_{\alpha ,\delta } \left( L \right)$$ such that for x ε ? ( \(\mathfrak{n}\) ): (*) $$r\left( x \right) = inf_L \left\{ {l \in L|\left( {\forall A \subseteq L} \right)x \in C\left( A \right) \Rightarrow l \in C\left( A \right)} \right\}$$ defines retraction, where C is a proper closure operator for \(B_{\alpha ,\delta }^\mathfrak{n} \) . It is also proved that the formula (*) defines retraction for all 〈α, δ〉, whenever L is an 〈α, δ〉 -pseudodistributive lattice. Moreover it is proved that when α=ω and δ=∞, the formula (*) defines identical retraction to the formula given in [7], and when α = 0 and δ=ω, the formula (*) defines identical retraction to the formula given in [4].  相似文献   
97.
Important positive as well as negative results on interpolation property in fragments of the intuitionistic propositional logic (INT) were obtained by J. I. Zucker in [6]. He proved that the interpolation theorem holds in purely implicational fragment of INT. He also gave an example of a fragment of INT for which interpolation fails. This fragment is determined by the constant falsum (), well known connectives: implication () and conjunction (), and by a ternary connective defined as follows: (p, q, r)= df (pq)(pr).Extending this result of J. I. Zucker, G. R. Renardel de Lavalette proved in [5] that there are continuously many fragments of INT without the interpolation property.This paper is meant to continue the research mentioned above. To be more precise, its aim is to answer questions concerning interpolation and amalgamation properties in varieties of equivalential algebras, particularly in the variety determined by the purely equivalential fragment of INT.  相似文献   
98.
The first part of the paper deals with some subclasses of B-algebras and their applications to the semantics of SCI B , the Boolean strengthening of the sentential calculus with identity (SCI). In the second part a generalization of the McKinsey-Tarski construction of well-connected topological Boolean, algebras to the class of B-algebras is given.  相似文献   
99.
Three main concepts of model in science are distinguished: (1) semantical model of a theory; (2) real model of another real thing; (3) mathematical model of a real thing. The last concept is the most important for the empirical sciences. The mathematical model is not identical with a theory: it is an ideal object which is directly described by the theory. We have here an intermediate level between reality and theory.  相似文献   
100.
Studies in East European Thought -  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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