全文获取类型
收费全文 | 1369篇 |
免费 | 163篇 |
国内免费 | 115篇 |
专业分类
1647篇 |
出版年
2023年 | 12篇 |
2022年 | 20篇 |
2021年 | 15篇 |
2020年 | 48篇 |
2019年 | 33篇 |
2018年 | 51篇 |
2017年 | 30篇 |
2016年 | 58篇 |
2015年 | 37篇 |
2014年 | 51篇 |
2013年 | 96篇 |
2012年 | 36篇 |
2011年 | 26篇 |
2010年 | 32篇 |
2009年 | 69篇 |
2008年 | 88篇 |
2007年 | 88篇 |
2006年 | 83篇 |
2005年 | 94篇 |
2004年 | 71篇 |
2003年 | 73篇 |
2002年 | 80篇 |
2001年 | 56篇 |
2000年 | 72篇 |
1999年 | 55篇 |
1998年 | 46篇 |
1997年 | 41篇 |
1996年 | 29篇 |
1995年 | 26篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 13篇 |
1987年 | 8篇 |
1986年 | 3篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 5篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 5篇 |
1975年 | 3篇 |
排序方式: 共有1647条查询结果,搜索用时 15 毫秒
811.
On the Representation of N4-Lattices 总被引:2,自引:1,他引:1
N4-lattices provide algebraic semantics for the logic N4, the paraconsistent variant of Nelson's logic with strong negation. We obtain the representation of N4-lattices showing that the structure of an arbitrary N4-lattice is completely determined by a suitable implicative lattice with distinguished filter and ideal. We introduce also special filters on N4-lattices and prove that special filters are exactly kernels of homomorphisms. Criteria of embeddability and to be a homomorphic image are obtained for N4-lattices in terms of the above mentioned representation. Finally, subdirectly irreducible N4-lattices are described. 相似文献
812.
Temporalising Tableaux 总被引:1,自引:0,他引:1
As a remedy for the bad computational behaviour of first-order temporal logic (FOTL), it has recently been proposed to restrict the application of temporal operators to formulas with at most one free variable thereby obtaining so-called monodic fragments of FOTL. In this paper, we are concerned with constructing tableau algorithms for monodic fragments based on decidable fragments of first-order logic like the two-variable fragment or the guarded fragment. We present a general framework that shows how existing decision procedures for first-order fragments can be used for constructing a tableau algorithm for the corresponding monodic fragment of FOTL. Some example instantiations of the framework are presented. 相似文献
813.
Bernhard Heinemann 《Studia Logica》2004,76(1):67-90
We present a modal logic for the class of subset spaces based on discretely descending chains of sets. Apart from the usual modalities for knowledge and effort the standard temporal connectives are included in the underlying language. Our main objective is to prove completeness of a corresponding axiomatization. Furthermore, we show that the system satisfies a certain finite model property and is decidable thus. 相似文献
814.
Statistics of Intuitionistic versus Classical Logics 总被引:2,自引:1,他引:1
For the given logical calculus we investigate the proportion of the number of true formulas of a certain length n to the number of all formulas of such length. We are especially interested in asymptotic behavior of this fraction when n tends to infinity. If the limit exists it is represented by a real number between 0 and 1 which we may call the density of truth for the investigated logic. In this paper we apply this approach to the intuitionistic logic of one variable with implication and negation. The result is obtained by reducing the problem to the same one of Dummett's intermediate linear logic of one variable (see [2]). Actually, this paper shows the exact density of intuitionistic logic and demonstrates that it covers a substantial part (more than 93%) of classical prepositional calculus. Despite using strictly mathematical means to solve all discussed problems, this paper in fact, may have a philosophical impact on understanding how much the phenomenon of truth is sporadic or frequent in random mathematics sentences. 相似文献
815.
Given the harmony principle for logical operators, compositionality ought to ensure that harmony should obtain at the level of whole contents. That is, the role of a content qua premise ought to be balanced exactly by its role as a conclusion. Frege's contextual definition of propositional content happens to exploit this balance, and one appeals to the Cut rule to show that the definition is adequate.We show here that Frege's definition remains adequate even when one relevantizes logic by abandoning an unrestricted Cut rule. The proof exploits the fact that in the relevantized logic, which abandons the unrestricted rule of Cut, any failure of the transitivity of deduction is offset by the epistemic gain involved in learning that a stronger-than-expected result holds. 相似文献
816.
The notion of an algebraic semantics of a deductive system was proposed in [3], and a preliminary study was begun. The focus of [3] was the definition and investigation of algebraizable deductive systems, i.e., the deductive systems that possess an equivalent algebraic semantics. The present paper explores the more general property of possessing an algebraic semantics. While a deductive system can have at most one equivalent algebraic semantics, it may have numerous different algebraic semantics. All of these give rise to an algebraic completeness theorem for the deductive system, but their algebraic properties, unlike those of equivalent algebraic semantics, need not reflect the metalogical properties of the deductive system. Many deductive systems that don't have an equivalent algebraic semantics do possess an algebraic semantics; examples of these phenomena are provided. It is shown that all extensions of a deductive system that possesses an algebraic semantics themselves possess an algebraic semantics. Necessary conditions for the existence of an algebraic semantics are given, and an example of a protoalgebraic deductive system that does not have an algebraic semantics is provided. The mono-unary deductive systems possessing an algebraic semantics are characterized. Finally, weak conditions on a deductive system are formulated that guarantee the existence of an algebraic semantics. These conditions are used to show that various classes of non-algebraizable deductive systems of modal logic, relevance logic and linear logic do possess an algebraic semantics. 相似文献
817.
Game Logic is a modal logic which extends Propositional Dynamic Logic by generalising its semantics and adding a new operator to the language. The logic can be used to reason about determined 2-player games. We present an overview of meta-theoretic results regarding this logic, also covering the algebraic version of the logic known as Game Algebra. 相似文献
818.
Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms. The language is based on the temporal logic CTL*, interpreted with respect to a version of the bundle semantics. 相似文献
819.
Suppose we have a stack of cards that is divided over some players. For certain distributions of cards it is possible to communicate your hand of cards to another player by public announcements, without yet another player learning any of your cards. A solution to this problem consists of some sequence of announcements and is called an exchange. It is called a direct exchange if it consists of (the minimum of) two announcements only. The announcements in an exchange have a special form: they are safe communications, an interesting new form of update. Certain unsafe communications turn out to be unsuccessful updates. A communication is a public announcement that is known to be true. Each communication may be about a set of alternative card deals only, and even about a set of alternatives to the communicating player's own hand only. We list the direct exchanges for a deal of seven cards where the two players holding three cards communicate their hands to each other. Our work may be applicable to the design of cryptographic protocols. 相似文献
820.
Robert Milnikel 《Studia Logica》2003,75(3):377-382
We present a straightforward embedding of modal nonmonotonic logics into default logic. 相似文献