全文获取类型
收费全文 | 908篇 |
免费 | 15篇 |
国内免费 | 2篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 3篇 |
2020年 | 13篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 4篇 |
2016年 | 30篇 |
2015年 | 10篇 |
2014年 | 19篇 |
2013年 | 42篇 |
2012年 | 5篇 |
2011年 | 6篇 |
2010年 | 9篇 |
2009年 | 47篇 |
2008年 | 71篇 |
2007年 | 73篇 |
2006年 | 57篇 |
2005年 | 71篇 |
2004年 | 55篇 |
2003年 | 57篇 |
2002年 | 58篇 |
2001年 | 39篇 |
2000年 | 58篇 |
1999年 | 39篇 |
1998年 | 32篇 |
1997年 | 33篇 |
1996年 | 21篇 |
1995年 | 20篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
排序方式: 共有925条查询结果,搜索用时 31 毫秒
151.
Three studies using the intermodal preferential looking paradigm examined onset of productive comprehension of tense/aspect morphology in English. When can toddlers understand these forms with novel verbs and novel events? The first study used familiar verbs and showed that 26–36-month olds correctly matched a past/perfective form (-ed or irregular past) to a completed version of an event and a present/imperfective (is V-ing) to the ongoing version of the same event. The second study used novel verbs and events and found that 33-month olds failed to use tense/aspect morphology to choose between completed and ongoing versions of the same event. The third study also used novel verbs and events but simplified the processing demands of the task in several ways (using initial priming of the events and classes of meaning, using different events within test pairs). This study found that 30-month olds successfully used tense/aspect morphology to choose between ongoing and completed novel events. The results demonstrate that children have productive command of tense/aspect morphology by 30 months and have therefore begun the process of creating an abstract grammar containing this element. 相似文献
152.
Standard Kripke models are inadequate to model situations of inexact knowledge with introspection, since positive and negative
introspection force the relation of epistemic indiscernibility to be transitive and euclidean. Correlatively, Williamson’s
margin for error semantics for inexact knowledge invalidates axioms 4 and 5. We present a new semantics for modal logic which
is shown to be complete for K45, without constraining the accessibility relation to be transitive or euclidean. The semantics corresponds to a system of
modular knowledge, in which iterated modalities and simple modalities are not on a par. We show how the semantics helps to
solve Williamson’s luminosity paradox, and argue that it corresponds to an integrated model of perceptual and introspective
knowledge that is psychologically more plausible than the one defended by Williamson. We formulate a generalized version of
the semantics, called token semantics, in which modalities are iteration-sensitive up to degree n and insensitive beyond n. The multi-agent version of the semantics yields a resource-sensitive logic with implications for the representation of common
knowledge in situations of bounded rationality. 相似文献
153.
Giorgi Japaridze 《Studia Logica》2009,91(1):1-24
Within the program of finding axiomatizations for various parts of computability logic, it was proven earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting’s intuitionistic
calculus. That sort of reduction permits unlimited reusage of the computational resource represented by the antecedent. An
at least equally basic and natural sort of algorithmic reduction, however, is the one that does not allow such reusage. The
present article shows that turning the logic of the first sort of reduction into the logic of the second sort of reduction
takes nothing more than just deleting the contraction rule from its Gentzen-style axiomatization. The first (Turing) sort
of interactive reduction is also shown to come in three natural versions. While those three versions are very different from
each other, their logical behaviors (in isolation) turn out to be indistinguishable, with that common behavior being precisely
captured by implicative intuitionistic logic. Among the other contributions of the present article is an informal introduction
of a series of new — finite and bounded — versions of recurrence operations and the associated reduction operations.
Presented by Robert Goldblatt 相似文献
154.
Ernst Zimmermann 《Studia Logica》2009,91(1):131-138
The paper presents predicate logical extensions of some subintuitionistic logics. Subintuitionistic logics result if conditions
of the accessibility relation in Kripke models for intuitionistic logic are dropped. The accessibility relation which interprets
implication in models for the propositional base subintuitionistic logic considered here is neither persistent on atoms, nor
reflexive, nor transitive. Strongly complete predicate logical extensions are modeled with a second accessibility relation,
which is a partial order, for the interpretation of the universal quantifier.
Presented by Melvin Fitting 相似文献
155.
Miklós Ferenczi 《Studia Logica》2009,92(1):121-135
If the language is extended by new individual variables, in classical first order logic, then the deduction system obtained
is a conservative extension of the original one. This fails to be true for the logics with infinitary predicates. But it is
shown that restricting the commutativity of quantifiers and the equality axioms in the extended system and supposing the merry-go-round
property in the original system, the foregoing extension is already conservative. It is shown that these restrictions are
crucial for an extension to be conservative. The origin of the results is algebraic logic.
Presented by Daniele Mundici
Supported by grant OTKA T43242. 相似文献
156.
Lena Kurzen 《Synthese》2009,169(2):223-240
In this paper, a logic for reasoning about coalitional power is developed which explicitly represents agents’ preferences
and the actions by which the agents can achieve certain results. A complete axiomatization is given and its satisfiability
problem is shown to be decidable and EXPTIME-hard. 相似文献
157.
研究结合数学分析方法,提出了基于非逻辑机制的条件推理模型:P-Q映射模型。并根据这个模型,对人们在不同命题类型奈件下的推理行为进行了预测。预测结果显示,当推理前提为LH和HL型命题时,基于P-Q映射模型的预测结果与基于条件概率模型的预测结果完全一致。但当推理前提为LL和HH型命题时,两种模型给出的预测结果存在差异。实验结果表明,当前提命题为LL和HH型命题时,被试的条件推理行为与P-Q映射模型的预言完全一致。 相似文献
158.
以大学生为被试,探讨认知风格与逻辑推理的关系。结果表明:(1)在三段论推理中,场依存型学生和场独立型学生推理成绩不存在显著差异,学过和未学过逻辑学的学生推理成绩也不存在显著差异,但男生和女生推理成绩差异显著,女生比男生更易受“气氛”的影响。(2)在命题推理中,对抽象材料构成的命题,场独立型学生和场依存型学生的推理存在显著差异,场独立型学生表现出更强的证伪倾向,场依存型学生表现出更强的换位倾向;对具体材料构成的命题,场独立型学生和场依存型学生的推理不存在显著差异。 相似文献
159.
George Voutsadakis 《Studia Logica》2007,85(2):215-249
Two classes of π are studied whose properties are similar to those of the protoalgebraic deductive systems of Blok and Pigozzi. The first
is the class of N-protoalgebraic π-institutions and the second is the wider class of N-prealgebraic π-institutions. Several characterizations are provided. For instance, N-prealgebraic π-institutions are exactly those π-institutions that satisfy monotonicity of the N-Leibniz operator on theory systems and N-protoalgebraic π-institutions those that satisfy monotonicity of the N-Leibniz operator on theory families. Analogs of the correspondence property of Blok and Pigozzi for π-institutions are also introduced and their connections with preand protoalgebraicity are explored. Finally, relations of
these two classes with the (, N)-algebraic systems, introduced previously by the author as an analog of the -algebras of Font and Jansana, and with an analog of the Suszko operator of Czelakowski for π-institutions are also investigated.
Presented by Josep Maria Font 相似文献
160.
Lou Goble 《Studia Logica》2007,85(2):171-197
The results of this paper extend some of the intimate relations that are known to obtain between combinatory logic and certain
substructural logics to establish a general characterization theorem that applies to a very broad family of such logics. In
particular, I demonstrate that, for every combinator X, if LX is the logic that results by adding the set of types assigned to X (in an appropriate type assignment system, TAS) as axioms
to the basic positive relevant logic B∘T, then LX is sound and complete with respect to the class of frames in the Routley-Meyer relational semantics for relevant and substructural
logics that meet a first-order condition that corresponds in a very direct way to the structure of the combinator X itself.
Presented by Rob Goldblatt 相似文献