全文获取类型
收费全文 | 273篇 |
免费 | 5篇 |
国内免费 | 7篇 |
出版年
2023年 | 2篇 |
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 2篇 |
2016年 | 9篇 |
2015年 | 1篇 |
2014年 | 3篇 |
2013年 | 9篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2010年 | 1篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2007年 | 16篇 |
2006年 | 23篇 |
2005年 | 19篇 |
2004年 | 18篇 |
2003年 | 16篇 |
2002年 | 27篇 |
2001年 | 16篇 |
2000年 | 27篇 |
1999年 | 15篇 |
1998年 | 12篇 |
1997年 | 15篇 |
1996年 | 7篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1989年 | 1篇 |
1985年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有285条查询结果,搜索用时 15 毫秒
61.
An analysis of (linear) exponentials based on extended sequents 总被引:1,自引:0,他引:1
62.
Christina Schneider 《Journal for General Philosophy of Science》1994,25(1):107-124
This approach does not define a probability measure by syntactical structures. It reveals a link between modal logic and mathematical probability theory. This is shown (1) by adding an operator (and two further connectives and constants) to a system of lower predicate calculus and (2) regarding the models of that extended system. These models are models of the modal systemS
5 (without the Barcan formula), where a usual probability measure is defined on their set of possible worlds. Mathematical probability models can be seen as models ofS
5. 相似文献
63.
64.
The relevant modal logic G is a simple extension of the logic RT, the relevant counterpart of the familiar classically based system T. Using the Routley–Meyer semantics for relevant modal logics, this paper proves three main results regarding G: (i) G is semantically complete, but only with a non-standard interpretation of necessity. From this, however, other nice properties follow. (ii) With a standard interpretation of necessity, G is semantically incomplete; there is no class of frames that characterizes G. (iii) The class of frames for G characterizes the classically based logic T. 相似文献
65.
66.
We demonstrate ways to incorporate nondeterminism in a system designed to formalize the reasoning of agents concerning their abilities and the results of the actions that they may perform. We distinguish between two kinds of nondeterministic choice operators: one that expresses an internal choice, in which the agent decides what action to take, and one that expresses an external choice, which cannot be influenced by the agent. The presence of abilities in our system is the reason why the usual approaches towards nondeterminism cannot be used here. The semantics that we define for nondeterministic actions is based on the idea that composite actions are unravelled in the strings of atomic actions and tests that constitute them. The main notions used in defining this semantics are finite computation sequences and finite computation runs of actions. The results that we obtain meet our intuitions regarding events and abilities in the presence of nondeterminism. 相似文献
67.
Dealing with topics of definability, this paper provides some interesting insights into the expressive power of basic modal logic. After some preliminary work it presents an abstract algebraic characterization of the elementary classes of basic modal logic, that is, of the classes of models that are definable by means of (sets of) basic modal formulas. Taking that for a start, the paper further contains characterization results for modal universal classes and modal positive classes. 相似文献
68.
69.
In this note we show that the classical modal technology of Sahlqvist formulas gives quick proofs of the completeness theorems in [8] (D. Gregory, Completeness and decidability results for some propositional modal logics containing actually operators, Journal of Philosophical Logic 30(1): 57–78, 2001) and vastly generalizes them. Moreover, as a corollary, interpolation theorems for the logics considered in [8] are obtained. We then compare Gregory's modal language enriched with an actually operator with the work of Arthur Prior now known under the name of hybrid logic. This analysis relates the actually axioms to standard hybrid axioms, yields the decidability results in [8], and provides a number of complexity results. Finally, we use a bisimulation argument to show that the hybrid language is strictly more expressive than Gregory's language. 相似文献
70.