全文获取类型
收费全文 | 364篇 |
免费 | 6篇 |
国内免费 | 8篇 |
专业分类
378篇 |
出版年
2023年 | 2篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 6篇 |
2017年 | 3篇 |
2016年 | 8篇 |
2015年 | 2篇 |
2014年 | 6篇 |
2013年 | 8篇 |
2012年 | 4篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 11篇 |
2008年 | 17篇 |
2007年 | 25篇 |
2006年 | 33篇 |
2005年 | 29篇 |
2004年 | 29篇 |
2003年 | 23篇 |
2002年 | 30篇 |
2001年 | 20篇 |
2000年 | 37篇 |
1999年 | 16篇 |
1998年 | 13篇 |
1997年 | 24篇 |
1996年 | 10篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1989年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有378条查询结果,搜索用时 15 毫秒
371.
It is natural to ask under what conditions negating a conditional is equivalent to negating its consequent. Given a bivalent
background logic, this is equivalent to asking about the conjunction of Conditional Excluded Middle (CEM, opposite conditionals
are not both false) and Weak Boethius' Thesis (WBT, opposite conditionals are not both true). In the system CI.0 of consequential
implication, which is intertranslatable with the modal logic KT, WBT is a theorem, so it is natural to ask which instances
of CEM are derivable. We also investigate the systems CIw and CI of consequential implication, corresponding to the modal
logics K and KD respectively, with occasional remarks about stronger systems. While unrestricted CEM produces modal collapse
in all these systems, CEM restricted to contingent formulas yields the Alt2 axiom (semantically, each world can see at most
two worlds), which corresponds to the symmetry of consequential implication. It is proved that in all the main systems considered,
a given instance of CEM is derivable if and only if the result of replacing consequential implication by the material biconditional
in one or other of its disjuncts is provable. Several related results are also proved. The methods of the paper are those
of propositional modal logic as applied to a special sort of conditional. 相似文献
372.
We propose a new, rather simple and short proof of Kripke-completeness for the predicate variant of Dummett's logic. Also
a family of Kripke-incomplete extensions of this logic that are complete w.r.t. Kripke frames with equality (or equivalently,
w.r.t. Kripke sheaves [8]), is described. 相似文献
373.
This paper develops a new proof method for two propositional paraconsistent logics: the propositional part of Batens' weak
paraconsistent logic CLuN and Schütte's maximally paraconsistent logic Φv. Proofs are de.ned as certain sequences of questions. The method is grounded in Inferential Erotetic Logic. 相似文献
374.
375.
Mark Reynolds 《Studia Logica》1996,57(2-3):279-302
We present an axiomatisation for the first-order temporal logic with connectives Until and Since over the class of all linear flows of time. Completeness of the axiom system is proved.We also add a few axioms to find a sound and complete axiomatisation for the first order temporal logic of Until and Since over rational numbers time.The author would like to thank Dov Gabbay and Ian Hodkinson for helpful discussions on this material. The work was supported by the U.K. Science and Engineering Research Council under the Metatem project (GR/F/28526).Presented by Dov Gabbay 相似文献
376.
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guarding knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting extended forest logic programs (EFoLPs) can be reduced to finite answer set programming, for which reasoners are available.We argue that extended forest logic programming is a useful tool for uniformly representing and reasoning with both ontological and rule-based knowledge, as they can capture a large fragment of the OWL DL ontology language equipped with DL-safe rules. Furthermore, EFoLPs enable nonmonotonic reasoning, a desirable feature in locally closed subareas of the Semantic Web. 相似文献
377.
378.