全文获取类型
收费全文 | 338篇 |
免费 | 9篇 |
国内免费 | 2篇 |
专业分类
349篇 |
出版年
2024年 | 8篇 |
2023年 | 4篇 |
2022年 | 3篇 |
2021年 | 12篇 |
2020年 | 7篇 |
2019年 | 14篇 |
2018年 | 18篇 |
2017年 | 7篇 |
2016年 | 11篇 |
2015年 | 12篇 |
2014年 | 9篇 |
2013年 | 30篇 |
2012年 | 7篇 |
2011年 | 5篇 |
2010年 | 2篇 |
2009年 | 14篇 |
2008年 | 24篇 |
2007年 | 20篇 |
2006年 | 18篇 |
2005年 | 14篇 |
2004年 | 14篇 |
2003年 | 16篇 |
2002年 | 11篇 |
2001年 | 13篇 |
2000年 | 17篇 |
1999年 | 12篇 |
1998年 | 5篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有349条查询结果,搜索用时 15 毫秒
141.
Yue J. Jiang 《Studia Logica》1993,52(2):259-280
One of the fundamental properties inclassical equational reasoning isLeibniz's principle of substitution. Unfortunately, this propertydoes not hold instandard epistemic logic. Furthermore,Herbrand's lifting theorem which isessential to thecompleteness ofresolution andParamodulation in theclassical first order logic (FOL), turns out to be invalid in standard epistemic logic. In particular, unlike classical logic, there is no skolemization normal form for standard epistemic logic. To solve these problems, we introduce anintensional epistemic logic, based on avariation of Kripke's possible-worlds semantics that need not have a constant domain. We show how a weaker notion of substitution through indexed terms can retain the Herbrand theorem. We prove how the logic can yield a satisfibility preserving skolemization form. In particular, we present an intensional principle for unifing indexed terms. Finally, we describe asound andcomplete inference system for a Horn subset of the logic withequality, based onepistemic SLD-resolution. 相似文献
142.
We examined infants’ perception of the intonational characteristics of yes-no questions and declarative sentences in English. Both infants habituated to questions and those habituated to declaratives preferred the question forms at test, suggesting that infants process these two sentence types differently. 相似文献
143.
Dimiter Vakarelov 《Studia Logica》2005,80(2-3):393-430
Constructive logic with Nelson negation is an extension of the intuitionistic logic with a special type of negation expressing some features of constructive falsity and refutation by counterexample. In this paper we generalize this logic weakening maximally the underlying intuitionistic negation. The resulting system, called subminimal logic with Nelson negation, is studied by means of a kind of algebras called generalized N-lattices. We show that generalized N-lattices admit representation formalizing the intuitive idea of refutation by means of counterexamples giving in this way a counterexample semantics of the logic in question and some of its natural extensions. Among the extensions which are near to the intuitionistic logic are the minimal logic with Nelson negation which is an extension of the Johansson's minimal logic with Nelson negation and its in a sense dual version — the co-minimal logic with Nelson negation. Among the extensions near to the classical logic are the well known 3-valued logic of Lukasiewicz, two 12-valued logics and one 48-valued logic. Standard questions for all these logics — decidability, Kripke-style semantics, complete axiomatizability, conservativeness are studied. At the end of the paper extensions based on a new connective of self-dual conjunction and an analog of the Lukasiewicz middle value ½ have also been considered. 相似文献
144.
The Logic and Meaning of Plurals. Part II 总被引:2,自引:1,他引:1
Byeong-uk Yi 《Journal of Philosophical Logic》2006,35(3):239-288
In this sequel to “The logic and meaning of plurals. Part I”, I continue to present an account of logic and language that
acknowledges limitations of singular constructions of natural languages and recognizes plural constructions as their peers.
To this end, I present a non-reductive account of plural constructions that results from the conception of plurals as devices
for talking about the many. In this paper, I give an informal semantics of plurals, formulate a formal characterization of
truth for the regimented languages that results from augmenting elementary languages with refinements of basic plural constructions
of natural languages, and account for the logic of plural constructions by characterizing the logic of those regimented languages.
相似文献
Byeong-uk YiEmail: |
145.
Karl Schafer 《Australasian journal of philosophy》2013,91(3):471-488
It is increasingly common to suggest that the combination of evolutionary theory and normative realism leads inevitably to a general scepticism about our ability to reliably form normative beliefs. In what follows, I argue that this is not the case. In particular, I consider several possible arguments from evolutionary theory and normative realism to normative scepticism and explain where they go wrong. I then offer a more general diagnosis of the tendency to accept such arguments and why this tendency should be resisted. 相似文献
146.
Even though Questions Answering and Database Querying have very different goals and frameworks, collaboration between the two fields could be mutually beneficial. However, the different assumptions in each field makes such collaboration difficult. In this paper, we introduce a query language with generalized quantifiers (QLGQ) and show how it could be used to help bridge the gap between the two fields. 相似文献
147.
Two extensions of the structurally free logic LC 总被引:1,自引:0,他引:1
148.
149.
This paper contains five observations concerning the intended meaning of the intuitionistic logical constants: (1) if the explanations of this meaning are to be based on a non-decidable concept, that concept should not be that of `proof"; (2) Kreisel"s explanations using extra clauses can be significantly simplified; (3) the impredicativity of the definition of can be easily and safely ameliorated; (4) the definition of in terms of `proofs from premises" results in a loss of the inductive character of the definitions of and and (5) the same occurs with the definition of in terms of `proofs with free variables". 相似文献
150.