全文获取类型
收费全文 | 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条查询结果,搜索用时 31 毫秒
751.
In this paper we consider an intuitionistic variant of the modal logic S4 (which we call IS4). The novelty of this paper is that we place particular importance on the natural deduction formulation of IS4— our formulation has several important metatheoretic properties. In addition, we study models of IS4— not in the framework of Kirpke semantics, but in the more general framework of category theory. This allows not only a more abstract definition of a whole class of models but also a means of modelling proofs as well as provability. 相似文献
752.
The main goal of this paper is to explain the link between the algebraic and the Kripke-style models for certain classes of
propositional logics. We start by presenting a Priestley-type duality for distributive lattices endowed with a general class
of well-behaved operators. We then show that finitely-generated varieties of distributive lattices with operators are closed
under canonical embedding algebras. The results are used in the second part of the paper to construct topological and non-topological
Kripke-style models for logics that are sound and complete with respect to varieties of distributive lattices with operators
in the above-mentioned classes.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
753.
We present a finitary regularly algebraizable logic not finitely equivalential, for every similarity type. We associate to
each of these logics a class of algebras with an equivalence relation, with the property that in this class, the identity
is atomatically definable but not finitely atomatically definable.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
754.
Michael Leff 《Argumentation》2000,14(3):241-254
The paper presents a historical overview of some characteristic differences between rhetoric and dialectic in the pre-modern tradition. In the light of this historical analysis, some current approaches to dialectic are characterized, with special attention to Ralph Johnson's concept of dialectical tier. 相似文献
755.
Many-valued reflexive autoepistemic logic 总被引:1,自引:0,他引:1
756.
Journal of Philosophical Logic - Within the traditional Hilbert space formalism of quantum mechanics, it is not possible to describe a particle as possessing, simultaneously, a sharp position value... 相似文献
757.
Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterminate number of agents. Also the naming schemes used in the logics often lack expressiveness to name agents in an intuitive way.To obtain a more expressive language for multi-agent reasoning and a better naming scheme for agents, we introduce a family of logics called term-modal logics. A main feature of our logics is the use of modal operators indexed by the terms of the logics. Thus, one can quantify over variables occurring in modal operators. In term-modal logics agents can be represented by terms, and knowledge of agents is expressed with formulas within the scope of modal operators.This gives us a flexible and uniform language for reasoning about the agents themselves and their knowledge. This article gives examples of the expressiveness of the languages and provides sequent-style and tableau-based proof systems for the logics. Furthermore we give proofs of soundness and completeness with respect to the possible world semantics. 相似文献
758.
In this paper, we compare several cut-free sequent systems for propositional intuitionistic logic Intwith respect to polynomial simulations. Such calculi can be divided into two classes, namely single-succedent calculi (like Gentzen's LJ) and multi-succedent calculi. We show that the latter allow for more compact proofs than the former. Moreover, for some classes of formulae, the same is true if proofs in single-succedent calculi are directed acyclic graphs (dags) instead of trees. Additionally, we investigate the effect of weakening rules on the structure and length of dag proofs.The second topic of this paper is the effect of different embeddings from Int to S4. We select two different embeddings from the literature and show that translated (propositional) intuitionistic formulae have sometimes exponentially shorter minimal proofs in a cut-free Gentzen system for S4than the original formula in a cut-free single-succedent Gentzen system for Int. Moreover, the length and the structure of proofs of translated formulae crucially depend on the chosen embedding. 相似文献
759.
Partiality and games: propositional logic 总被引:2,自引:0,他引:2
760.
Products, or how to create modal logics of high complexity 总被引:1,自引:0,他引:1