全文获取类型
收费全文 | 364篇 |
免费 | 6篇 |
国内免费 | 8篇 |
出版年
2023年 | 2篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 6篇 |
2017年 | 3篇 |
2016年 | 8篇 |
2015年 | 2篇 |
2014年 | 6篇 |
2013年 | 8篇 |
2012年 | 4篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 11篇 |
2008年 | 17篇 |
2007年 | 25篇 |
2006年 | 33篇 |
2005年 | 29篇 |
2004年 | 29篇 |
2003年 | 23篇 |
2002年 | 30篇 |
2001年 | 20篇 |
2000年 | 37篇 |
1999年 | 16篇 |
1998年 | 13篇 |
1997年 | 24篇 |
1996年 | 10篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1989年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有378条查询结果,搜索用时 15 毫秒
61.
Paulo A. S. Veloso Renata P. de Freitas Petrucio Viana Mario Benevides Sheila R. M. Veloso 《Journal of Philosophical Logic》2007,36(5):489-509
We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language)
and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its
expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic
the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power
of its first-order correspondence language, so both can express the same input–output behavior of processes. 相似文献
62.
The pure implicational and the multiplicative fragments of arange of propositional relevant (and other) logics are shownto have the property that any two formulas equivalent in sucha logic are constructed from exactly the same propositionalvariables as opposed to merely having (as the definitionof relevance itself would require) some propositional variablein common. 相似文献
63.
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. 相似文献
64.
Petr Hájek 《Studia Logica》2009,91(3):367-382
Some aspects of vagueness as presented in Shapiro’s book Vagueness in Context [23] are analyzed from the point of fuzzy logic.
Presented are some generalizations of Shapiro’s formal apparatus.
Presented by Daniele Mundici 相似文献
65.
66.
George Voutsadakis 《Studia Logica》2007,85(2):215-249
Two classes of π are studied whose properties are similar to those of the protoalgebraic deductive systems of Blok and Pigozzi. The first
is the class of N-protoalgebraic π-institutions and the second is the wider class of N-prealgebraic π-institutions. Several characterizations are provided. For instance, N-prealgebraic π-institutions are exactly those π-institutions that satisfy monotonicity of the N-Leibniz operator on theory systems and N-protoalgebraic π-institutions those that satisfy monotonicity of the N-Leibniz operator on theory families. Analogs of the correspondence property of Blok and Pigozzi for π-institutions are also introduced and their connections with preand protoalgebraicity are explored. Finally, relations of
these two classes with the (, N)-algebraic systems, introduced previously by the author as an analog of the -algebras of Font and Jansana, and with an analog of the Suszko operator of Czelakowski for π-institutions are also investigated.
Presented by Josep Maria Font 相似文献
67.
Lou Goble 《Studia Logica》2007,85(2):171-197
The results of this paper extend some of the intimate relations that are known to obtain between combinatory logic and certain
substructural logics to establish a general characterization theorem that applies to a very broad family of such logics. In
particular, I demonstrate that, for every combinator X, if LX is the logic that results by adding the set of types assigned to X (in an appropriate type assignment system, TAS) as axioms
to the basic positive relevant logic B∘T, then LX is sound and complete with respect to the class of frames in the Routley-Meyer relational semantics for relevant and substructural
logics that meet a first-order condition that corresponds in a very direct way to the structure of the combinator X itself.
Presented by Rob Goldblatt 相似文献
68.
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 相似文献
69.
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. 相似文献
70.
Interpolation in practical formal development 总被引:2,自引:0,他引:2