全文获取类型
收费全文 | 289篇 |
免费 | 13篇 |
国内免费 | 10篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 7篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 15篇 |
2017年 | 5篇 |
2016年 | 9篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 27篇 |
2012年 | 4篇 |
2011年 | 5篇 |
2010年 | 2篇 |
2009年 | 14篇 |
2008年 | 23篇 |
2007年 | 20篇 |
2006年 | 18篇 |
2005年 | 14篇 |
2004年 | 14篇 |
2003年 | 16篇 |
2002年 | 11篇 |
2001年 | 13篇 |
2000年 | 17篇 |
1999年 | 12篇 |
1998年 | 5篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有312条查询结果,搜索用时 31 毫秒
271.
The problems that arise from the presence of self-attacking arguments and odd-length cycles of attack within argumentation frameworks are widely recognized in the literature on defeasible argumentation. This paper introduces two simple semantics to capture different intuitions about what kinds of arguments should become justified in such scenarios. These semantics are modeled upon two extensions of argumentation frameworks, which we call sustainable and tolerant. Each one is constructed on the common ground of the powerful concept of admissibility introduced by Dung in [P.M. Dung, On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming, and n-person games, Artificial Intelligence 77 (1995) 321–357]. The novelty of this approach consists in viewing the admissibility of a subset of arguments as relative to potentially challenging subsets of arguments. Both sustainable and tolerant semantics are more credulous than preferred semantics (i.e. they justify at least the same arguments, and possibly more). Given certain sufficient conditions they coincide among them as well as with other semantics introduced by Dung. 相似文献
272.
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. 相似文献
273.
This paper presents a neighborhood semantics for logics of entailment. It begins with a minimal system Min that expresses the most fundamental assumptions about the entailment relation, and continues by examining various extensions that reflect further assumptions that might be made about entailment. This leads first to the logic B that is the basic relevant logic, and then to more powerful systems. All of these logics are proved to be sound and strongly complete. With B the neighborhood semantics meets the Routley–Meyer relational semantics for relevant logic; these connections are examined. The minimal and basic entailment logics are shown to have the finite model property, and hence to be decidable. 相似文献
274.
Extended Quantum Logic 总被引:1,自引:0,他引:1
The concept of quantum logic is extended so that it covers a more general set of propositions that involve non-trivial probabilities. This structure is shown to be embedded into a multi-modal framework, which has desirable logical properties such as an axiomatization, the finite model property and decidability. 相似文献
275.
Ryszard Wójcicki 《Studia Logica》2003,73(3):323-335
The title of this paper is a theorem, which I am going to state and prove. The theorem extends from prepositional to predicate languages the result I presented in [5]. 相似文献
276.
We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties – here called CE quantifiers – one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further identify a stronger form of monotonicity, called smoothness, which also has linguistic relevance, and we extend our considerations to smooth quantifiers. The results lead us to propose two tentative universals concerning monotonicity and natural language quantification. The notions involved as well as our proofs are presented using a graphical representation of quantifiers in the so-called number triangle. 相似文献
277.
The Genesis of Possible Worlds Semantics 总被引:1,自引:0,他引:1
This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913–1921; Feys, 1924; McKinsey, 1945; Carnap, 1945–1947; McKinsey, Tarski and Jónsson, 1947–1952; von Wright, 1951; Becker, 1952; Prior, 1953–1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955–1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958–1959; Drake, 1959–1961; Kripke, 1958–1965. 相似文献
278.
Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules
In this paper, we propose a game semantics for the (associative) Lambek calculus. Compared to the implicational fragment of intuitionistic propositional calculus, the semantics deals with two features of
the logic: absence of structural rules, as well as directionality of implication. We investigate the impact of these variations
of the logic on its game semantics.
Presented by Wojciech Buszkowski 相似文献
279.
Prior’s three-valued modal logic Q was developed as a philosophically interesting modal logic. Thus, we should be able to modify Q as a temporal logic. Although a temporal version of Q was suggested by Prior, the subject has not been fully explored in the literature. In this paper, we develop a three-valued
temporal logic Q
t
and give its axiomatization and semantics. We also argue that Q
t
provides a smooth solution to the problem of future contingents.
Presented by Daniele Mundici 相似文献
280.