全文获取类型
收费全文 | 273篇 |
免费 | 5篇 |
国内免费 | 7篇 |
出版年
2023年 | 2篇 |
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 2篇 |
2016年 | 9篇 |
2015年 | 1篇 |
2014年 | 3篇 |
2013年 | 9篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2010年 | 1篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2007年 | 16篇 |
2006年 | 23篇 |
2005年 | 19篇 |
2004年 | 18篇 |
2003年 | 16篇 |
2002年 | 27篇 |
2001年 | 16篇 |
2000年 | 27篇 |
1999年 | 15篇 |
1998年 | 12篇 |
1997年 | 15篇 |
1996年 | 7篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1989年 | 1篇 |
1985年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有285条查询结果,搜索用时 15 毫秒
41.
Stefan Kaufmann 《Journal of Philosophical Logic》2009,38(1):1-53
The fact that the standard probabilistic calculus does not define probabilities for sentences with embedded conditionals is
a fundamental problem for the probabilistic theory of conditionals. Several authors have explored ways to assign probabilities
to such sentences, but those proposals have come under criticism for making counterintuitive predictions. This paper examines
the source of the problematic predictions and proposes an amendment which corrects them in a principled way. The account brings
intuitions about counterfactual conditionals to bear on the interpretation of indicatives and relies on the notion of causal
(in)dependence. 相似文献
42.
Norihiro Kamide 《Studia Logica》2009,91(2):217-238
New propositional and first-order paraconsistent logics (called L
ω
and FL
ω
, respectively) are introduced as Gentzen-type sequent calculi with classical and paraconsistent negations. The embedding
theorems of L
ω
and FL
ω
into propositional (first-order, respectively) classical logic are shown, and the completeness theorems with respect to simple
semantics for L
ω
and FL
ω
are proved. The cut-elimination theorems for L
ω
and FL
ω
are shown using both syntactical ways via the embedding theorems and semantical ways via the completeness theorems.
Presented by Yaroslav Shramko and Heinrich Wansing 相似文献
43.
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 相似文献
44.
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. 相似文献
45.
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. 相似文献
46.
Martin Amerbauer 《Studia Logica》1996,57(2-3):359-372
We give sound and complete tableau and sequent calculi for the prepositional normal modal logics S4.04, K4B and G
0(these logics are the smallest normal modal logics containing K and the schemata A A, A A and A ( A); A A and AA; A A and ((A A) A) A resp.) with the following properties: the calculi for S4.04 and G
0are cut-free and have the interpolation property, the calculus for K4B contains a restricted version of the cut-rule, the so-called analytical cut-rule.In addition we show that G
0is not compact (and therefore not canonical), and we proof with the tableau-method that G
0is characterised by the class of all finite, (transitive) trees of degenerate or simple clusters of worlds; therefore G
0is decidable and also characterised by the class of all frames for G
0.Research supported by Fonds zur Förderung der wissenschaftlichen Forschung, project number P8495-PHY.Presented by W. Rautenberg 相似文献
47.
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 相似文献
48.
The paper first formalizes the ramified type theory as (informally) described in the Principia Mathematica [32]. This formalization is close to the ideas of the Principia, but also meets contemporary requirements on formality and accuracy, and therefore is a new supply to the known literature on the Principia (like [25], [19], [6] and [7]).As an alternative, notions from the ramified type theory are expressed in a lambda calculus style. This situates the type system of Russell and Whitehead in a modern setting. Both formalizations are inspired by current developments in research on type theory and typed lambda calculus; see [3].Supported by the Co-operation Centre Tilburg and Eindhoven Universities. 1[32], Introduction, Chapter II, Section I, p. 37.Presented by Wolfgang Rautenberg 相似文献
49.
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. 相似文献
50.
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. 相似文献