全文获取类型
收费全文 | 899篇 |
免费 | 15篇 |
国内免费 | 3篇 |
专业分类
917篇 |
出版年
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条查询结果,搜索用时 0 毫秒
721.
Larisa Maksimova 《Studia Logica》2006,83(1-3):365-391
All extensions of the modal Grzegorczyk logic Grz possessing projective Beth's property PB2 are described. It is proved that
there are exactly 13 logics over Grz with PB2. All of them are finitely axiomatizable and have the finite model property.
It is shown that PB2 is strongly decidable over Grz, i.e. there is an algorithm which, for any finite system Rul of additional
axiom schemes and rules of inference, decides if the calculus Grz+Rul has the projective Beth property.
Dedicated to the memory of Willem Johannes Blok 相似文献
722.
In this paper, it is argued that Ferguson’s (2003, Argumentation 17, 335–346) recent proposal to reconcile monotonic logic with defeasibility has three counterintuitive consequences. First, the conclusions that can be derived from his new rule of inference are vacuous, a point that as already made against default logics when there are conflicting defaults. Second, his proposal requires a procedural “hack” to the break the symmetry between the disjuncts of the tautological conclusions to which his proposal leads. Third, Ferguson’s proposal amounts to arguing that all everyday inferences are sound by definition. It is concluded that the informal logic response to defeasibility, that an account of the context in which inferences are sound or unsound is required, still stands. It is also observed that another possible response is given by Bayesian probability theory (Oaksford and Chater, in press, Bayesian Rationality: The Probabilistic Approach to Human Reasoning, Oxford University Press, Oxford, UK; Hahn and Oaksford, in press, Synthese). 相似文献
723.
The theorem proving system Tps provides support for constructing proofs using a mix of automation and user interaction, and for manipulating and inspecting proofs. Its library facilities allow the user to store and organize work. Mathematical theorems can be expressed very naturally in Tps using higher-order logic. A number of proof representations are available in Tps, so proofs can be inspected from various perspectives. 相似文献
724.
Diamonds are a Philosopher's Best Friends 总被引:1,自引:0,他引:1
The knowability paradox is an instance of a remarkable reasoning pattern (actually, a pair of such patterns), in the course of which an occurrence of the possibility operator, the diamond, disappears. In the present paper, it is pointed out how the unwanted disappearance of the diamond may be escaped. The emphasis is not laid on a discussion of the contentious premise of the knowability paradox, namely that all truths are possibly known, but on how from this assumption the conclusion is derived that all truths are, in fact, known. Nevertheless, the solution offered is in the spirit of the constructivist attitude usually maintained by defenders of the anti-realist premise. In order to avoid the paradoxical reasoning, a paraconsistent constructive relevant modal epistemic logic with strong negation is defined semantically. The system is axiomatized and shown to be complete. 相似文献
725.
Standard first-order logic plus quantifiers of all finite orders (SFOL) faces four well-known difficulties when used to characterize the behavior of certain English quantifier phrases. All four difficulties seem to stem from the typed structure of SFOL models. The typed structure of SFOL models is in turn a product of an asymmetry between the meaning of names and the meaning of predicates, the element-set asymmetry. In this paper we examine a class of models in which this asymmetry of meaning is removed. The models of this class permit definitions of the quantifiers which allow a desirable flexibility in fixing the domain of quantification. Certain SFOL type restrictions are thereby avoided. The resulting models of English validate all of the standard first-order logical truths and are free of the four deficiencies of SFOL models. 相似文献
726.
Todd Bernard Weber 《Argumentation》2002,16(4):459-472
In this paper I argue for modesty concerning what theoretical reason can accomplish in the moral dilemmas debate. Specifically, I contend that philosophers' conclusions for or against moral dilemmas are driven less by rational argument and more by how the moral world intuitively appears to them.I support this thesis by first considering an argument against moral dilemmas, the argument from deontic logic, and showing that its persuasive force depends on one's having already accepted its conclusion. I then make a different, and general, case that any argument in the moral dilemmas debate concerning the defeasibility of conflicting obligations can be marginalized by making not-unreasonable adjustments in the conditions for wrongdoing.These two strands of argument are related by the notion of inescapable wrongdoing. It is our standing intuitions about inescapable wrongdoing which make the relevant deontic logical principles plausible or implausible to us. And whether wrongdoing can be inescapable is central to deciding what the conditions for wrongdoing are. My conclusion is that the arguments in the moral dilemmas debate merely implement whatever standing intuition we have concerning inescapable wrongdoing, and that apart from any such intuition the arguments are unpersuasive. 相似文献
727.
In their seminal paper Birkhoff and von Neumann revealed the following dilemma:[ ] whereas for logicians the orthocomplementation properties of negation were the ones least able to withstand a critical analysis, the study of mechanics points to the distributive identities as the weakest link in the algebra of logic.In this paper we eliminate this dilemma, providing a way for maintaining both. Via the introduction of the "missing" disjunctions in the lattice of properties of a physical system while inheriting the meet as a conjunction we obtain a complete Heyting algebra of propositions on physical properties. In particular there is a bijective correspondence between property lattices and propositional lattices equipped with a so called operational resolution, an operation that exposes the properties on the level of the propositions. If the property lattice goes equipped with an orthocomplementation, then this bijective correspondence can be refined to one with propositional lattices equipped with an operational complementation, as such establishing the claim made above. Formally one rediscovers via physical and logical considerations as such respectively a specification and a refinement of the purely mathematical result by Bruns and Lakser (1970) on injective hulls of meet-semilattices. From our representation we can derive a truly intuitionistic functional implication on property lattices, as such confronting claims made in previous writings on the matter. We also make a detailed analysis of disjunctivity vs. distributivity and finitary vs. infinitary conjunctivity, we briefly review the Bruns-Lakser construction and indicate some questions which are left open. 相似文献
728.
We prove decidability of satisfiability of sentences of the monodic packed fragment of first-order temporal logic with equality and connectives Until and Since, in models with various flows of time and domains of arbitrary cardinality. We also prove decidability over models with finite domains, over flows of time including the real order. 相似文献
729.
Mathematical modal logic: A view of its evolution 总被引:1,自引:0,他引:1
This is a survey of the origins of mathematical interpretations of modal logics, and their development over the last century or so. It focuses on the interconnections between algebraic semantics using Boolean algebras with operators and relational semantics using structures often called Kripke models. It reviews the ideas of a number of people who independently contributed to the emergence of relational semantics, and compares them with the work of Kripke. It concludes with an account of several applications of modal model theory to mathematics and theoretical computer science. 相似文献
730.
In this paper, we consider three different search strategies for a cut-free sequent system formalizing orthologic, and estimate the respective search spaces. Applying backward search, there are classes of formulae for which both the minimal proof length and the search space are exponential. In a combined forward and backward approach, all proofs are polynomial, but the potential search space remains exponential. Using a forward strategy, the potential search space becomes polynomial yielding a polynomial decision procedure for orthologic and the word problem for free ortholattices. 相似文献