全文获取类型
收费全文 | 900篇 |
免费 | 15篇 |
国内免费 | 2篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 3篇 |
2020年 | 12篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 4篇 |
2016年 | 30篇 |
2015年 | 9篇 |
2014年 | 19篇 |
2013年 | 42篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 9篇 |
2009年 | 45篇 |
2008年 | 71篇 |
2007年 | 71篇 |
2006年 | 57篇 |
2005年 | 71篇 |
2004年 | 55篇 |
2003年 | 57篇 |
2002年 | 58篇 |
2001年 | 39篇 |
2000年 | 58篇 |
1999年 | 38篇 |
1998年 | 32篇 |
1997年 | 33篇 |
1996年 | 21篇 |
1995年 | 20篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
排序方式: 共有917条查询结果,搜索用时 15 毫秒
811.
In human social interaction, the notions of commitment and trust are strongly interrelated. A formal model for this interrelation will enable artificial agents to benefit from the associated reduction of complexity and improved possibilities for cooperation. We argue that the notion of living up to one's commitments, rather than actual fulfillment, plays the key role in the trust–commitment interrelation, and we propose a formal analysis of that notion in the framework of agents and strategies in branching time. The main technical innovation is a stringency ordering on an agent's strategies that allows one to classify what an agent does as more or less appropriate with respect to a given commitment, leading to a fine-grained assessment of trustworthiness. 相似文献
812.
This note explains an error in Restall’s ‘Simplified Semantics for Relevant Logics (and some of their rivals)’ (Restall, J
Philos Logic 22(5):481–511, 1993) concerning the modelling conditions for the axioms of assertion A → ((A → B) → B) (there called c6) and permutation (A → (B → C)) → (B → (A → C)) (there called c7). We show that the modelling conditions for assertion and permutation proposed in ‘Simplified Semantics’ overgenerate. In
fact, they overgenerate so badly that the proposed semantics for the relevant logic R validate the rule of disjunctive syllogism.
The semantics provides for no models of R in which the “base point” is inconsistent. This problem is not restricted to ‘Simplified Semantics.’ The techniques
of that paper are used in Graham Priest’s textbook An Introduction to Non-Classical Logic (Priest, 2001), which is in wide circulation: it is important to find a solution. In this article, we explain this result, diagnose the
mistake in ‘Simplified Semantics’ and propose two different corrections. 相似文献
813.
We show that the variety of n-dimensional weakly higher order cylindric algebras, introduced in Németi [9], [8], is finitely axiomatizable when n > 2. Our result implies that in certain non-well-founded set theories the finitization problem of algebraic logic admits
a positive solution; and it shows that this variety is a good candidate for being the cylindric algebra theoretic counterpart
of Tarski’s quasi-projective relation algebras.
Supported by the Hungarian National Foundation for Scientific Research grant T73601. 相似文献
814.
José Ferreirós 《Synthese》2009,170(1):33-70
David Hilbert’s early foundational views, especially those corresponding to the 1890s, are analysed here. I consider strong evidence for the fact that Hilbert was a logicist at that time, following upon Dedekind’s footsteps in his understanding of pure mathematics. This insight makes it possible to throw new light on the evolution of Hilbert’s foundational ideas, including his early contributions to the foundations of geometry and the real number system. The context of Dedekind-style logicism makes it possible to offer a new analysis of the emergence of Hilbert’s famous ideas on mathematical existence, now seen as a revision of basic principles of the “naive logic” of sets. At the same time, careful scrutiny of his published and unpublished work around the turn of the century uncovers deep differences between his ideas about consistency proofs before and after 1904. Along the way, we cover topics such as the role of sets and of the dichotomic conception of set theory in Hilbert’s early axiomatics, and offer detailed analyses of Hilbert’s paradox and of his completeness axiom (Vollständigkeitsaxiom). 相似文献
815.
816.
Edwin D. Mares 《Synthese》2009,167(2):343-362
This paper sets out a philosophical interpretation of the model theory of Mares and Goldblatt (The Journal of Symbolic Logic
71, 2006). This interpretation distinguishes between truth conditions and information conditions. Whereas the usual Tarskian
truth condition holds for universally quantified statements, their information condition is quite different. The information
condition utilizes general propositions. The present paper gives a philosophical explanation of general propositions and argues that these are needed to give an
adequate theory of general information. 相似文献
817.
The logic of how-questions 总被引:1,自引:0,他引:1
William Jaworski 《Synthese》2009,166(1):133-155
Philosophers and scientists are concerned with the why and the how of things. Questions like the following are so much grist for the philosopher’s and scientist’s mill: How can we be free and yet live in a deterministic universe?, How do neural processes give rise to conscious experience?, Why does conscious experience accompany certain physiological events at all?, How is a three-dimensional perception of depth generated by a pair of two-dimensional retinal images?. Since Belnap and Steel’s pioneering work on the logic of questions, Van Fraassen has managed to apply their approach in constructing an account of the logic of why-questions. Comparatively little, by contrast, has been written on the logic of how-questions despite the apparent centrality of questions such as How is it possible for us to be both free and determined? to philosophical enterprise.1 In what follows I develop a logic for how-questions of various sorts including how-questions of cognitive resolution, how-questions of manner, how-questions of method, of means, and of mechanism. 相似文献
818.
将一个图形(称为母图)的若干条线段删除后得到的图形叫做母图的子图。运用实验方法探讨了子图结构学习和子图变式学习对解决问题的迁移效果。结果表明:子图结构学习仅对解决“图形结构相同、逻辑结构相同”问题有明显迁移作用;子图变式学习对解决“图形结构相同、逻辑结构相同”没有明显迁移作用,对“图形结构相似、逻辑结构相同”、“图形结构相同、逻辑结构相似”以及“图形结构相似、逻辑结构相似”四类问题均有明显迁移作用。 相似文献
819.
820.
Paolo Liberatore 《Studia Logica》2007,86(1):89-110
A consistency default is a propositional inference rule that asserts the consistency of a formula in its consequence. Consistency
defaults allow for a straightforward encoding of domains in which it is explicitely known when something is possible. The
logic of consistency defaults can be seen as a variant of cumulative default logic or as a generalization of justified default
logic; it is also able to simulate Reiter default logic in the seminormal case. A semantical characterization of consistency
defaults in terms of processes and in terms of a fixpoint equation is given, as well as a normal form.
Presented by Melvin Fitting 相似文献