全文获取类型
收费全文 | 354篇 |
免费 | 5篇 |
国内免费 | 6篇 |
专业分类
365篇 |
出版年
2025年 | 1篇 |
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 5篇 |
2016年 | 12篇 |
2015年 | 2篇 |
2014年 | 9篇 |
2013年 | 9篇 |
2012年 | 10篇 |
2011年 | 6篇 |
2010年 | 2篇 |
2009年 | 11篇 |
2008年 | 13篇 |
2007年 | 22篇 |
2006年 | 28篇 |
2005年 | 24篇 |
2004年 | 20篇 |
2003年 | 16篇 |
2002年 | 30篇 |
2001年 | 18篇 |
2000年 | 30篇 |
1999年 | 17篇 |
1998年 | 12篇 |
1997年 | 18篇 |
1996年 | 11篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1985年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有365条查询结果,搜索用时 0 毫秒
51.
Willem Blok and Modal Logic 总被引:1,自引:0,他引:1
We present our personal view on W.J. Blok's contribution to modal logic. 相似文献
52.
In this paper, we show the weak normalization (WN) of the simply-typedse-calculus with open terms where abstractions are decoratedwith types, and metavariables, de Bruijn indices and updatingoperators are decorated with environments. We show a proof ofWN using the e-calculus, a calculus isomorphic to . This proof is strongly influenced by Goubault-Larrecq'sproof of WN for the -calculus but with subtle differences whichshow that the two styles require different attention. Furthermore,we give a new calculus 'e which works like se but which iscloser to than e. For both e and 'e we prove WN for typedsemi-open terms (i.e. those which allow term variables but nosubstitution variables), unlike the result of Goubault-Larrecqwhich covered all open terms. 相似文献
53.
This paper makes a point about the interpretation of the simplestquantified modal logic, that is, quantified modal logic witha single domain. It is commonly assumed that the domain in questionis to be understood as the set of all possibile objects. Thepoint of the paper is that this assumption is misguided. 相似文献
54.
Ernst Zimmermann 《Studia Logica》2009,91(1):131-138
The paper presents predicate logical extensions of some subintuitionistic logics. Subintuitionistic logics result if conditions
of the accessibility relation in Kripke models for intuitionistic logic are dropped. The accessibility relation which interprets
implication in models for the propositional base subintuitionistic logic considered here is neither persistent on atoms, nor
reflexive, nor transitive. Strongly complete predicate logical extensions are modeled with a second accessibility relation,
which is a partial order, for the interpretation of the universal quantifier.
Presented by Melvin Fitting 相似文献
55.
56.
Phiniki Stouppa 《Studia Logica》2007,85(2):199-214
We present a cut-admissible system for the modal logic S5 in a formalism that makes explicit and intensive use of deep inference.
Deep inference is induced by the methods applied so far in conceptually pure systems for this logic. The system enjoys systematicity
and modularity, two important properties that should be satisfied by modal systems. Furthermore, it enjoys a simple and direct
design: the rules are few and the modal rules are in exact correspondence to the modal axioms.
Presented by Heinrich Wansing 相似文献
57.
Denis Béchet 《Studia Logica》2007,87(2-3):199-224
The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linear logic and for Lambek calculus allowing
empty premises. 相似文献
58.
Linh Anh Nguyen 《Studia Logica》2001,69(1):41-57
We give complete sequent-like tableau systems for the modal logics KB, KDB, K5, and KD5. Analytic cut rules are used to obtain the completeness. Our systems have the analytic superformula property and can thus give a decision procedure. Using the systems, we prove the Craig interpolation lemma for the mentioned logics. 相似文献
59.
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 相似文献
60.
The quality of approximations to first and second order moments (e.g., statistics like means, variances, regression coefficients) based on latent ability estimates is being discussed. The ability estimates are obtained using either the Rasch, or the two-parameter logistic model. Straightforward use of such statistics to make inferences with respect to true latent ability is not recommended, unless we account for the fact that the basic quantities are estimates. In this paper true score theory is used to account for the latter; the counterpart of observed/true score being estimated/true latent ability. It is shown that statistics based on the true score theory are virtually unbiased if the number of items presented to each examinee is larger than fifteen. Three types of estimators are compared: maximum likelihood, weighted maximum likelihood, and Bayes modal. Furthermore, the (dis)advantages of the true score method and direct modeling of latent ability is discussed. 相似文献