全文获取类型
收费全文 | 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 毫秒
91.
健康行动过程取向(HAPA)模型的提出源于健康行为社会认知模型的发展和Bandura社会认知理论的应用。在HAPA中, 健康行为变化被视为一个包括行为产生、保持和恢复在内的连续过程; 结果预期、危险感知、三种自我效能感和两类计划被用来解释意图的形成及其向行动的转化; 两个阶段的划分有助于区分三类干预对象, 建议实施菜单式干预。HAPA模型具有明显的理论优势, 也引发了有关模型实质的争论。当前和未来的研究旨在考察更多的自我调节变量、检验因果模型, 在健康行为的多个领域开展应用和干预研究。 相似文献
92.
We introduce various sequent systems for propositional logicshaving strict implication, and prove the completeness theoremsand the finite model properties of these systems.The cut-eliminationtheorems or the (modified) subformula properties are provedsemantically. 相似文献
93.
Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics
A serial context-free grammar logic is a normal multimodal logicL characterized by the seriality axioms and a set of inclusionaxioms of the form ts1...sk. Such an inclusion axiom correspondsto the grammar rule t s1... sk. Thus the inclusion axioms ofL capture a context-free grammar . If for every modal index t, the set of words derivable fromt using is a regular language, then L is a serial regular grammar logic. In this paper, we present an algorithm that, given a positivemultimodal logic program P and a set of finite automata specifyinga serial regular grammar logic L, constructs a finite leastL-model of P. (A model M is less than or equal to model M' iffor every positive formula , if M then M' .) A least L-modelM of P has the property that for every positive formula , P iff M . The algorithm runs in exponential time and returnsa model with size 2O(n3). We give examples of P and L, for bothof the case when L is fixed or P is fixed, such that every finiteleast L-model of P must have size 2(n). We also prove that ifG is a context-free grammar and L is the serial grammar logiccorresponding to G then there exists a finite least L-modelof s p iff the set of words derivable from s using G is a regularlanguage. 相似文献
94.
We describe a KB Gödelian ontological system, and some other weak systems, in a fully formal way using theory of types and natural deduction, and present a completeness proof in its main and specific parts. We technically and philosophically analyze and comment on the systems (mainly with respect to the relativism of values) and include a sketch of some connected aspects of Gödel's relation to Kant. 相似文献
95.
模态系统的推理规则可以用强弱虚实这四种性质进行分类。在一个系统中这几种性质无论在语形上还是语义上都有一定的联系和区别,有些性质在一个系统的变种或扩充中并不一定保持。 相似文献
96.
《Metaphilosophy》2002,33(3):387-396
Books reviewed:
James Campbell, Recovering Benjamin Franklin
Elliot L. Jurist, Beyond Hegel and Nietzsche: Philosophy, Culture, and Agency 相似文献
James Campbell, Recovering Benjamin Franklin
Elliot L. Jurist, Beyond Hegel and Nietzsche: Philosophy, Culture, and Agency 相似文献
97.
In this paper we improve the results of [2] by proving the product f.m.p. for the product of minimal n-modal and minimal n-temporal logic. For this case we modify the finite depth method introduced in [1]. The main result is applied to identify new fragments of classical first-order logic and of the equational theory of relation algebras, that are decidable and have the finite model property. 相似文献
98.
Dorota Leszczyńska-Jasion 《Journal of Philosophical Logic》2009,38(2):151-177
The aim of this paper is to present a loop-free decision procedure for modal propositional logics K4, S4 and S5. We prove that the procedure terminates and that it is sound and complete. The procedure is based on the method of Socratic
proofs for modal logics, which is grounded in the logic of questions IEL. 相似文献
99.
Melvin Fitting 《Studia Logica》2009,91(3):335-366
This is a largely expository paper in which the following simple idea is pursued. Take the truth value of a formula to be
the set of agents that accept the formula as true. This means we work with an arbitrary (finite) Boolean algebra as the truth
value space. When this is properly formalized, complete modal tableau systems exist, and there are natural versions of bisimulations
that behave well from an algebraic point of view. There remain significant problems concerning the proper formalization, in
this context, of natural language statements, particularly those involving negative knowledge and common knowledge. A case
study is presented which brings these problems to the fore. None of the basic material presented here is new to this paper—all
has appeared in several papers over many years, by the present author and by others. Much of the development in the literature
is more general than here—we have confined things to the Boolean case for simplicity and clarity. Most proofs are omitted,
but several of the examples are new. The main virtue of the present paper is its coherent presentation of a systematic point
of view—identify the truth value of a formula with the set of those who say the formula is true. 相似文献
100.
In "Doing Well Enough: Toward a Logic for Common Sense Morality", Paul McNamara sets out a semantics for a deontic logic which contains the operator It is supererogatory that. As well as having a binary accessibility relation on worlds, that semantics contains a relative ordering relation, . For worlds u, v and w, we say that u w v when v is at least as good as u according to the standards of w. In this paper we axiomatize logics complete over three versions of the semantics. We call the strongest of these logics DWE for Doing Well Enough. 相似文献