全文获取类型
收费全文 | 247篇 |
免费 | 5篇 |
国内免费 | 10篇 |
出版年
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 10篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 5篇 |
2011年 | 2篇 |
2010年 | 7篇 |
2009年 | 10篇 |
2008年 | 15篇 |
2007年 | 16篇 |
2006年 | 23篇 |
2005年 | 27篇 |
2004年 | 16篇 |
2003年 | 13篇 |
2002年 | 16篇 |
2001年 | 16篇 |
2000年 | 15篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 21篇 |
1996年 | 7篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有262条查询结果,搜索用时 15 毫秒
61.
Wojciech Buszkowski 《Studia Logica》1996,57(2-3):303-323
We prove the finite model property (fmp) for BCI and BCI with additive conjunction, which answers some open questions in Meyer and Ono [11]. We also obtain similar results for some restricted versions of these systems in the style of the Lambek calculus [10, 3]. The key tool is the method of barriers which was earlier introduced by the author to prove fmp for the product-free Lambek calculus [2] and the commutative product-free Lambek calculus [4].Presented by H. Ono 相似文献
62.
63.
Mauro Ferrari 《Studia Logica》1997,59(3):303-330
In this paper we provide cut-free tableau calculi for the intuitionistic modal logics IK, ID, IT, i.e. the intuitionistic analogues of the classical modal systems K, D and T. Further, we analyse the necessity of duplicating formulas to which rules are applied. In order to develop these calculi we extend to the modal case some ideas presented by Miglioli, Moscato and Ornaghi for intuitionistic logic. Specifically, we enlarge the language with the new signs Fc and CR near to the usual signs T and F. In this work we establish the soundness and completeness theorems for these calculi with respect to the Kripke semantics proposed by Fischer Servi. 相似文献
64.
Michael Fisher 《Journal of Applied Logic》2011,9(4):223-238
Autonomous agents are not so difficult to construct. Constructing autonomous agents that will work as required is much harder. A clear way in which we can design and analyse autonomous systems so that we can be more confident that their behaviour is as required is to use formal methods. These can, in principle, allow us to exactly specify the behaviour of the agent, and verify that any implementation has the properties required. In addition to using a more formal approach, it is clear that problems of conceptualisation and analysis can be aided by the use of an appropriate abstraction.In this article we tackle one particular aspect of formal methods for agent-based systems, namely the formal representation and implementation of deliberation within agents. The key aspect here is simplicity. Agents are specified using a relatively simple temporal logic and are executed by directly interpreting such temporal formulae. Deliberation is captured by modifying the way in which execution handles its temporal goals. Thus, in this article we provide motivations, theoretical underpinnings, implementation details, correctness arguments, and comparisons with related work. 相似文献
65.
We discuss Smirnovs problem of finding a common background for classifying implicational logics. We formulate and solve the problem of extending, in an appropriate way, an implicational fragment H
of the intuitionistic propositional logic to an implicational fragment TV
of the classical propositional logic. As a result we obtain logical constructions having the form of Boolean lattices whose elements are implicational logics. In this way, whole classes of new logics can be obtained. We also consider the transition from implicational logics to full logics. On the base of the lattices constructed, we formulate the main classification principles for propositional logics. 相似文献
66.
An intermediate predicate logic L is called finite iff it is characterized by a finite partially ordered set M, i.e., iff L is the logic of the class of all predicate Kripke frames based on M. In this paper we study axiomatizability of logics of this kind. Namely, we consider logics characterized by finite trees M of a certain type (levelwise uniform trees) and establish the finite axiomatizability criterion for this case. 相似文献
67.
In this paper we characterize, classify and axiomatize all axiomatic extensions of the IMT3 logic. This logic is the axiomatic extension of the involutive monoidal t-norm logic given by ¬φ3 ∨ φ. For our purpose we study the lattice of all subvarieties of the class IMT3, which is the variety of IMTL-algebras given by the equation ¬(x3) ∨ x ≈ ?, and it is the algebraic counterpart of IMT3 logic. Since every subvariety of IMT3 is generated by their totally ordered members, we study the structure of all IMT3-chains in order to determine the lattice of all subvarieties of IMT3. Given a family of IMT3-chains the number of elements of the largest odd finite subalgebra in the family and the number of elements of the largest even finite subalgebra in the family turns out to be a complete classifier of the variety generated. We obtain a canonical set of generators and a finite equational axiomatization for each subvariety and, for each corresponding logic, a finite set of characteristic matrices and a finite set of axioms. 相似文献
68.
This paper focuses on model interpretation issues and employs a geometric approach to compare the potential value of using
the Grade of Membership (GoM) model in representing population heterogeneity. We consider population heterogeneity manifolds
generated by letting subject specific parameters vary over their natural range, while keeping other population parameters
fixed, in the marginal space (based on marginal probabilities) and in the full parameter space (based on cell probabilities).
The case of a 2 × 2 contingency table is discussed in detail, and a generalization to 2J tables with J ≥ 3 is sketched. Our approach highlights the main distinction between the GoM model and the probabilistic mixture of classes
by demonstrating geometrically the difference between the concepts of partial and probabilistic memberships. By using the
geometric approach we show that, in special cases, the GoM model can be thought of as being similar to an item response theory
(IRT) model in representing population heterogeneity. Finally, we show that the GoM item parameters can provide quantities
analogous to more general logistic IRT item parameters. As a latent structure model, the GoM model might be considered a useful
alternative for a data analysis when both classes of extreme responses, and additional heterogeneity that cannot be captured
by those latent classes, are expected in the population.
This work was supported by Award #1R03 AG18986-01 from the National Institute on Aging and NIH grant #1R01 CA94212-01. The
presentation of the ideas in this paper owes much to discussions with Stephen Fienberg and Brian Junker, Carnegie Mellon University.
The author thanks Jim Ramsay and two anonymous reviewers for their valuable comments on earlier drafts of this paper. 相似文献
69.
We study a class of finite models for the Lambek Calculus with additive conjunction and with and without empty antecedents. The class of models enables us to prove the finite model property for each of the above systems, and for some axiomatic extensions of them. This work strengthens the results of [3] where only product-free fragments of these systems are considered. A characteristic feature of this approach is that we do not rely on cut elimination in opposition to e.g. [5], [9]. 相似文献
70.