全文获取类型
收费全文 | 334篇 |
免费 | 24篇 |
国内免费 | 19篇 |
出版年
2023年 | 4篇 |
2022年 | 2篇 |
2021年 | 9篇 |
2020年 | 14篇 |
2019年 | 16篇 |
2018年 | 18篇 |
2017年 | 10篇 |
2016年 | 14篇 |
2015年 | 12篇 |
2014年 | 14篇 |
2013年 | 34篇 |
2012年 | 5篇 |
2011年 | 8篇 |
2010年 | 3篇 |
2009年 | 19篇 |
2008年 | 28篇 |
2007年 | 23篇 |
2006年 | 17篇 |
2005年 | 15篇 |
2004年 | 15篇 |
2003年 | 15篇 |
2002年 | 11篇 |
2001年 | 14篇 |
2000年 | 18篇 |
1999年 | 12篇 |
1998年 | 5篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有377条查询结果,搜索用时 156 毫秒
1.
Combinators and structurally free logic 总被引:2,自引:0,他引:2
2.
Compositional semantics for a language of imperfect information 总被引:3,自引:0,他引:3
3.
The problems we deal with concern reasoning about incomplete knowledge. Knowledge is understood as ability of an ideal rational agent to make decisions about pieces of information. The formalisms we are particularly interested in are Moore's autoepistemic logic (AEL) and its variant, the logic of acceptance and rejection (AEL2). It is well-known that AEL may be seen as the nonmonotonic KD45 modal logic. The aim is to give an appropriate modal formalization for AEL2. 相似文献
4.
Frank Veltman 《Journal of Philosophical Logic》1996,25(3):221-261
The aim of this paper is twofold: (i) to introduce the framework of update semantics and to explain what kind of semantic phenomena may successfully be analysed in it: (ii) to give a detailed analysis of one such phenomenon: default reasoning. 相似文献
5.
D. C. McCarty 《Journal of Philosophical Logic》1996,25(5):559-565
Let S be a deductive system such that S-derivability (s) is arithmetic and sound with respect to structures of class K. From simple conditions on K and s, it follows constructively that the K-completeness of s implies MP(S), a form of Markov's Principle. If s is undecidable then MP(S) is independent of first-order Heyting arithmetic. Also, if s is undecidable and the S proof relation is decidable, then MP(S) is independent of second-order Heyting arithmetic, HAS. Lastly, when s is many-one complete, MP(S) implies the usual Markov's Principle MP.An immediate corollary is that the Tarski, Beth and Kripke weak completeness theorems for the negative fragment of intuitionistic predicate logic are unobtainable in HAS. Second, each of these: weak completeness for classical predicate logic, weak completeness for the negative fragment of intuitionistic predicate logic and strong completeness for sentential logic implics MP. Beth and Kripke completeness for intuitionistic predicate or sentential logic also entail MP.These results give extensions of the theorem of Gödel and Kreisel (in [4]) that completeness for pure intuitionistic predicate logic requires MP. The assumptions of Gödel and Kreisel's original proof included the Axiom of Dependent Choice and Herbrand's Theorem, no use of which is explicit in the present article. 相似文献
6.
The paper discusses regularisation of dualities. A given duality between (concrete) categories, e.g. a variety of algebras and a category of representation spaces, is lifted to a duality between the respective categories of semilattice representations in the category of algebras and the category of spaces. In particular, this gives duality for the regularisation of an irregular variety that has a duality. If the type of the variety includes constants, then the regularisation depends critically on the location or absence of constants within the defining identities. The role of schizophrenic objects is discussed, and a number of applications are given. Among these applications are different forms of regularisation of Priestley, Stone and Pontryagin dualities. 相似文献
7.
Anne Ellerup Nielsen 《Argumentation》1996,10(3):329-345
The semantic relations between and within utterances are marked by the use of connectors and adverbials. One type of semantic relations is causal relations expressed by causal markers such as because, therefore, so, for, etc. Some of these markers cover different types of causal relations such as causality, explanation and justification. In certain types of discourse, causal relations also imply an intentional element. This paper describes the way in which the semantic and pragmatic functions of causal markers can be accounted for in terms of linguistic and rhetorical theories of argumentation. 相似文献
8.
9.
Localisation and navigation of autonomous vehicles (AVs) in static environments are now solved problems, but how to control their interactions with other road users in mixed traffic environments, especially with pedestrians, remains an open question. Recent work has begun to apply game theory to model and control AV-pedestrian interactions as they compete for space on the road whilst trying to avoid collisions. But this game theory model has been developed only in unrealistic lab environments. To improve their realism, this study empirically examines pedestrian behaviour during road crossing in the presence of approaching autonomous vehicles in more realistic virtual reality (VR) environments. The autonomous vehicles are controlled using game theory, and this study seeks to find the best parameters for these controls to produce comfortable interactions for the pedestrians. In a first experiment, participants’ trajectories reveal a more cautious crossing behaviour in VR than in previous laboratory experiments. In two further experiments, a gradient descent approach is used to investigate participants’ preference for AV driving style. The results show that the majority of participants were not expecting the AV to stop in some scenarios, and there was no change in their crossing behaviour in two environments and with different car models suggestive of car and last-mile style vehicles. These results provide some initial estimates for game theoretic parameters needed by future AVs in their pedestrian interactions and more generally show how such parameters can be inferred from virtual reality experiments. 相似文献
10.
The present paper deals with the predicate version MTL of the logic MTL by Esteva and Godo. We introduce a Kripke semantics for it, along the lines of Ono's Kripke semantics for the predicate version of FLew (cf. [O85]), and we prove a completeness theorem. Then we prove that every predicate logic between MTL and classical predicate logic is undecidable. Finally, we prove that MTL is complete with respect to the standard semantics, i.e., with respect to Kripke frames on the real interval [0,1], or equivalently, with respect to MTL-algebras whose lattice reduct is [0,1] with the usual order. 相似文献