全文获取类型
收费全文 | 305篇 |
免费 | 13篇 |
国内免费 | 10篇 |
出版年
2023年 | 3篇 |
2022年 | 1篇 |
2021年 | 7篇 |
2020年 | 6篇 |
2019年 | 8篇 |
2018年 | 14篇 |
2017年 | 5篇 |
2016年 | 9篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 25篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2010年 | 2篇 |
2009年 | 14篇 |
2008年 | 23篇 |
2007年 | 15篇 |
2006年 | 19篇 |
2005年 | 16篇 |
2004年 | 15篇 |
2003年 | 15篇 |
2002年 | 14篇 |
2001年 | 17篇 |
2000年 | 25篇 |
1999年 | 15篇 |
1998年 | 10篇 |
1997年 | 15篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有328条查询结果,搜索用时 15 毫秒
271.
Visual word recognition is widely considered to be automatic in the sense that activation of meaning occurs both in the absence of intent and despite the reader's intent to not read the word. New evidence from the semantic priming paradigm and the Stroop paradigm undermines this view. Semantic processing depends strongly on attentional control over how activation is distributed across different levels of representation. 相似文献
272.
273.
We investigate the semantics of the logical systems obtained by introducing the modalities and into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Then, in the spirit of the LDS (Labelled Deductive Systems) methodology, we "import" this semantics into the classical proof system KE. This leads to the formulation of a uniform labelled refutation system for the new logics which is a natural extension of a system for substructural implication developed by the first two authors in a previous paper. 相似文献
274.
Kripke bundle [3] and C-set semantics [1] [2] are known as semantics which generalize standard Kripke semantics. In [3] and in [1], [2] it is shown that Kripke bundle and C-set semantics are stronger than standard Kripke semantics. Also it is true that C-set semantics for superintuitionistic logics is stronger than Kripke bundle semantics [5].In this paper, we show that Q-S4.1 is not Kripke bundle complete via C-set models. As a corollary we can give a simple proof showing that C-set semantics for modal logics are stronger than Kripke bundle semantics. 相似文献
275.
Combining non-classical (or sub-classical) logics is not easy, but it is very interesting. In this paper, we combine nonclassical logics of negation and possibility (in the presence of conjunction and disjunction), and then we combine the resulting systems with intuitionistic logic. We will find that Kracht's results on the undecidability of classical modal logics generalise to a non-classical setting. We will also see conditions under which intuitionistic logic can be combined with a non-intuitionistic negation without corrupting the intuitionistic fragment of the logic. 相似文献
276.
A possible world structure consist of a set W of possible worlds and an accessibility relation R. We take a partial function r(·,·) to the unit interval [0, 1] instead of R and obtain a Kripke frame with graded accessibility r Intuitively, r(x, y) can be regarded as the reliability factor of y from x We deal with multimodal logics corresponding to Kripke frames with graded accessibility in a fairly general setting. This setting provides us with a framework for fuzzy possible world semantics. The basic propositional multimodal logic gK (grated K) is defined syntactically. We prove that gK is sound and complete with respect to this semantics. We discuss some extensions of gK including logics of similarity relations and of fuzzy orderings. We present a modified filtration method and prove that gK and its extensions introduced here are decidable. 相似文献
277.
Michael Zakharyaschev 《Studia Logica》1997,59(3):345-358
This paper gives a characterization of those quasi-normal extensions of the modal system S4 into which intuitionistic propositional logic Int is embeddable by the Gödel translation. It is shown that, as in the normal case, the set of quasi-normal modal companions of Int contains the greatest logic, M*, for which, however, the analog of the Blok-Esakia theorem does not hold. M* is proved to be decidable and Halldén-complete; it has the disjunction property but does not have the finite model property. 相似文献
278.
A note on logical relations between semantics and syntax 总被引:1,自引:0,他引:1
279.
The Genesis of Possible Worlds Semantics 总被引:1,自引:0,他引:1
This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913–1921; Feys, 1924; McKinsey, 1945; Carnap, 1945–1947; McKinsey, Tarski and Jónsson, 1947–1952; von Wright, 1951; Becker, 1952; Prior, 1953–1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955–1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958–1959; Drake, 1959–1961; Kripke, 1958–1965. 相似文献
280.
We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties – here called CE quantifiers – one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further identify a stronger form of monotonicity, called smoothness, which also has linguistic relevance, and we extend our considerations to smooth quantifiers. The results lead us to propose two tentative universals concerning monotonicity and natural language quantification. The notions involved as well as our proofs are presented using a graphical representation of quantifiers in the so-called number triangle. 相似文献