全文获取类型
收费全文 | 305篇 |
免费 | 13篇 |
国内免费 | 10篇 |
专业分类
328篇 |
出版年
2023年 | 3篇 |
2022年 | 1篇 |
2021年 | 7篇 |
2020年 | 6篇 |
2019年 | 8篇 |
2018年 | 14篇 |
2017年 | 5篇 |
2016年 | 9篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 25篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2010年 | 2篇 |
2009年 | 14篇 |
2008年 | 23篇 |
2007年 | 15篇 |
2006年 | 19篇 |
2005年 | 16篇 |
2004年 | 15篇 |
2003年 | 15篇 |
2002年 | 14篇 |
2001年 | 17篇 |
2000年 | 25篇 |
1999年 | 15篇 |
1998年 | 10篇 |
1997年 | 15篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有328条查询结果,搜索用时 15 毫秒
1.
Combinators and structurally free logic 总被引:2,自引:0,他引:2
2.
Compositional semantics for a language of imperfect information 总被引:3,自引:0,他引:3
3.
This paper investigates partitions of lattices of modal logics based on superintuitionistic logics which are defined by forming, for each superintuitionistic logic L and classical modal logic , the set L[] of L-companions of . Here L[] consists of those modal logics whose non-modal fragments coincide with L and which axiomatize if the law of excluded middle p V p is added. Questions addressed are, for instance, whether there exist logics with the disjunction property in L[], whether L[] contains a smallest element, and whether L[] contains lower covers of . Positive solutions as concerns the last question show that there are (uncountably many) superclean modal logics based on intuitionistic logic in the sense of Vakarelov [28]. Thus a number of problems stated in [28] are solved. As a technical tool the paper develops the splitting technique for lattices of modal logics based on superintuitionistic logics and ap plies duality theory from [34]. 相似文献
4.
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. 相似文献
5.
This papers gives a survey of recent results about simulations of one class of modal logics by another class and of the transfer of properties of modal logics under extensions of the underlying modal language. We discuss: the transfer from normal polymodal logics to their fusions, the transfer from normal modal logics to their extensions by adding the universal modality, and the transfer from normal monomodal logics to minimal tense extensions. Likewise, we discuss simulations of normal polymodal logics by normal monomodal logics, of nominals and the difference operator by normal operators, of monotonic monomodal logics by normal bimodal logics, of polyadic normal modal logics by polymodal normal modal logics, and of intuitionistic modal logics by normal bimodal logics. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.