全文获取类型
收费全文 | 2784篇 |
免费 | 237篇 |
国内免费 | 127篇 |
出版年
2023年 | 43篇 |
2022年 | 51篇 |
2021年 | 57篇 |
2020年 | 112篇 |
2019年 | 136篇 |
2018年 | 131篇 |
2017年 | 142篇 |
2016年 | 140篇 |
2015年 | 113篇 |
2014年 | 98篇 |
2013年 | 311篇 |
2012年 | 61篇 |
2011年 | 67篇 |
2010年 | 59篇 |
2009年 | 104篇 |
2008年 | 161篇 |
2007年 | 182篇 |
2006年 | 147篇 |
2005年 | 143篇 |
2004年 | 100篇 |
2003年 | 101篇 |
2002年 | 103篇 |
2001年 | 65篇 |
2000年 | 77篇 |
1999年 | 56篇 |
1998年 | 54篇 |
1997年 | 44篇 |
1996年 | 36篇 |
1995年 | 39篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 9篇 |
1991年 | 10篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 9篇 |
1987年 | 5篇 |
1985年 | 7篇 |
1984年 | 13篇 |
1983年 | 8篇 |
1982年 | 12篇 |
1981年 | 11篇 |
1980年 | 12篇 |
1979年 | 12篇 |
1978年 | 9篇 |
1977年 | 14篇 |
1976年 | 5篇 |
1975年 | 7篇 |
1974年 | 9篇 |
1973年 | 5篇 |
排序方式: 共有3148条查询结果,搜索用时 15 毫秒
141.
An ontology's theory of ontic predication has implications for the concomitant predicate logic. Remarkable in its analytic power for both ontology and logic is the here developed Particularized Predicate Logic (PPL), the logic inherent in the realist version of the doctrine of unit or individuated predicates. PPL, as axiomatized and proven consistent below, is a three-sorted impredicative intensional logic with identity, having variables ranging over individuals x, intensions R, and instances of intensions Ri. The power of PPL is illustrated by its clarification of the self-referential nature of impredicative definitions and its distinguishing between legitimate and illegitimate forms. With a well-motivated refinement on the axiom of comprehension, PPL is, in effect, a higher-order logic without a forced stratification of predicates into types or the use of other ad hoc restrictions. The Russell–Priest characterization of the classic self-referential paradoxes is used to show how PPL diagnosis and solves these antimonies. A direct application of PPL is made to Grelling's Paradox. Also shown is how PPL can distinguish between identity and indiscernibility. 相似文献
142.
Provided here is a characterisation of absolute probability functions for intuitionistic (propositional) logic L, i.e. a set of constraints on the unary functions P from the statements of L to the reals, which insures that (i) if a statement A of L is provable in L, then P(A) = 1 for every P, L's axiomatisation being thus sound in the probabilistic sense, and (ii) if P(A) = 1 for every P, then A is provable in L, L's axiomatisation being thus complete in the probabilistic sense. As there are theorems of classical (propositional) logic that are not intuitionistic ones, there are unary probability functions for intuitionistic logic that are not classical ones. Provided here because of this is a means of singling out the classical probability functions from among the intuitionistic ones. 相似文献
143.
The Relation between Formal and Informal Logic 总被引:1,自引:0,他引:1
Ralph H. Johnson 《Argumentation》1999,13(3):265-274
The issue of the relationship between formal and informal logic depends strongly on how one understands these two designations. While there is very little disagreement about the nature of formal logic, the same is not true regarding informal logic, which is understood in various (often incompatible) ways by various thinkers. After reviewing some of the more prominent conceptions of informal logic, I will present my own, defend it and then show how informal logic, so understood, is complementary to formal logic. 相似文献
144.
Lagretta Tallent Lenker 《Journal of Aging and Identity》1999,4(3):141-154
Bernard Shaw's critique of society's sacred cows, as well as his participation in the social, cultural and political marketplace in which he lived, resemble the new historical/cultural materialism of contemporary theory. In Back to Methuselah, Shaw examines the notions of aging and illuminates the degree to which our chronological standards of old age are sociological not biological constructs. This tour de force on aging both dramatizes age as a function of societal and/or individual choice, not as a biological given, and juxtaposes opinions toward aging in such a way that flexible attitudes toward the subject emerge. 相似文献
145.
146.
147.
Alan Williams 《Ethical Theory and Moral Practice》1999,2(1):47-55
In the popular folklore three-score-years-and-ten is treated as a fair innings for people, and thereby serves as an informal reference point for judgements about distributive justice within a community. But length of life alone is an insufficient basis for such judgements - a person's health-related quality-of-life also needs to be taken into account. If one of the objectives of public policy is to reduce inequalities in lifetime health, it will be demonstrated that this is very likely to require systematic discrimination against the older members of a community. The notion of community solidatity will also be tested, because a decision will need to be made as to whether the same fair innings applies to all members of the community, or whether some are entitled to more than others. The strength of the fair innings principle is that it brings these issues to the fore in a systematic way which should ais their resolition in a practical context. 相似文献
148.
Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae
In this paper a unified framework for dealing with a broad family of propositional multimodal logics is developed. The key tools for presentation of the logics are the notions of closure relation operation and monotonous relation operation. The two classes of logics: FiRe-logics (finitely reducible logics) and LaFiRe-logics (FiRe-logics with local agreement of accessibility relations) are introduced within the proposed framework. Further classes of logics can be handled indirectly by means of suitable translations. It is shown that the logics from these classes have the finite model property with respect to the class of -formulae, i.e. each -formula has a -model iff it has a finite -model. Roughly speaking, a -formula is logically equivalent to a formula in negative normal form without occurrences of modal operators with necessity force. In the proof we introduce a substantial modification of Claudio Cerrato's filtration technique that has been originally designed for graded modal logics. The main core of the proof consists in building adequate restrictions of models while preserving the semantics of the operators used to build terms indexing the modal operators. 相似文献
149.
The logic of proofs was introduced by Artemov in order to analize the formalization of the concept of proof rather than the concept of provability. In this context, some operations on proofs play a very important role. In this paper, we investigate some very natural operations, paying attention not only to positive information, but also to negative information (i.e. information saying that something cannot be a proof). We give a formalization for a fragment of such a logic of proofs, and we prove that our fragment is complete and decidable. 相似文献
150.
The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem's modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap's display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan formula or its converse to be derived. En route from the minimal modal predicate logic to full first-order logic, axiomatic extensions are captured by purely structural sequent rules. 相似文献