全文获取类型
收费全文 | 1123篇 |
免费 | 105篇 |
国内免费 | 2篇 |
出版年
2024年 | 2篇 |
2023年 | 19篇 |
2022年 | 5篇 |
2021年 | 15篇 |
2020年 | 42篇 |
2019年 | 43篇 |
2018年 | 29篇 |
2017年 | 37篇 |
2016年 | 47篇 |
2015年 | 28篇 |
2014年 | 27篇 |
2013年 | 137篇 |
2012年 | 11篇 |
2011年 | 5篇 |
2010年 | 9篇 |
2009年 | 45篇 |
2008年 | 72篇 |
2007年 | 72篇 |
2006年 | 58篇 |
2005年 | 72篇 |
2004年 | 57篇 |
2003年 | 60篇 |
2002年 | 59篇 |
2001年 | 40篇 |
2000年 | 58篇 |
1999年 | 38篇 |
1998年 | 32篇 |
1997年 | 34篇 |
1996年 | 21篇 |
1995年 | 20篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1985年 | 1篇 |
1983年 | 2篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1230条查询结果,搜索用时 15 毫秒
211.
证候存在的逻辑回答 总被引:1,自引:0,他引:1
黄开泰 《医学与哲学(人文社会医学版)》2007,28(3):74-75
认为存在的就是客观的,包含了自然客观、思维客观和理性客观;把疾病现象和疾病本质划等号,在症状层面规范证候标准,抛弃中医辨证思维,就等于否定中医。物质不能等于客观,不能取代存在。证候属于理性客观,发生于中医学,是中医“阴阳神气”观念临床实在化(还原)的必然。 相似文献
212.
Paulo A. S. Veloso Renata P. de Freitas Petrucio Viana Mario Benevides Sheila R. M. Veloso 《Journal of Philosophical Logic》2007,36(5):489-509
We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language)
and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its
expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic
the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power
of its first-order correspondence language, so both can express the same input–output behavior of processes. 相似文献
213.
This paper makes a point about the interpretation of the simplestquantified modal logic, that is, quantified modal logic witha single domain. It is commonly assumed that the domain in questionis to be understood as the set of all possibile objects. Thepoint of the paper is that this assumption is misguided. 相似文献
214.
We investigate certain aspects of the first-order theory oforthogonality structures - structures consisting of a domainof lines subject to a binary orthogonality relation. In particular,we establish definitions of various geometric and algebraicnotions in terms of orthogonality, describe the constructionof extremal subspaces using orthogonality, and show that thefirst-order theory of line orthogonality in the Euclidean n-spaceis not 0-categorical for n 3. 相似文献
215.
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. 相似文献
216.
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 相似文献
217.
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 相似文献
218.
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. 相似文献
219.
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. 相似文献
220.
研究结合数学分析方法,提出了基于非逻辑机制的条件推理模型:P-Q映射模型。并根据这个模型,对人们在不同命题类型奈件下的推理行为进行了预测。预测结果显示,当推理前提为LH和HL型命题时,基于P-Q映射模型的预测结果与基于条件概率模型的预测结果完全一致。但当推理前提为LL和HH型命题时,两种模型给出的预测结果存在差异。实验结果表明,当前提命题为LL和HH型命题时,被试的条件推理行为与P-Q映射模型的预言完全一致。 相似文献