全文获取类型
收费全文 | 932篇 |
免费 | 16篇 |
国内免费 | 2篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 15篇 |
2019年 | 11篇 |
2018年 | 7篇 |
2017年 | 6篇 |
2016年 | 31篇 |
2015年 | 10篇 |
2014年 | 22篇 |
2013年 | 44篇 |
2012年 | 7篇 |
2011年 | 6篇 |
2010年 | 10篇 |
2009年 | 45篇 |
2008年 | 73篇 |
2007年 | 72篇 |
2006年 | 57篇 |
2005年 | 72篇 |
2004年 | 55篇 |
2003年 | 58篇 |
2002年 | 59篇 |
2001年 | 40篇 |
2000年 | 58篇 |
1999年 | 38篇 |
1998年 | 32篇 |
1997年 | 33篇 |
1996年 | 21篇 |
1995年 | 22篇 |
1994年 | 7篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
排序方式: 共有950条查询结果,搜索用时 15 毫秒
161.
Lena Kurzen 《Synthese》2009,169(2):223-240
In this paper, a logic for reasoning about coalitional power is developed which explicitly represents agents’ preferences
and the actions by which the agents can achieve certain results. A complete axiomatization is given and its satisfiability
problem is shown to be decidable and EXPTIME-hard. 相似文献
162.
研究结合数学分析方法,提出了基于非逻辑机制的条件推理模型:P-Q映射模型。并根据这个模型,对人们在不同命题类型奈件下的推理行为进行了预测。预测结果显示,当推理前提为LH和HL型命题时,基于P-Q映射模型的预测结果与基于条件概率模型的预测结果完全一致。但当推理前提为LL和HH型命题时,两种模型给出的预测结果存在差异。实验结果表明,当前提命题为LL和HH型命题时,被试的条件推理行为与P-Q映射模型的预言完全一致。 相似文献
163.
以大学生为被试,探讨认知风格与逻辑推理的关系。结果表明:(1)在三段论推理中,场依存型学生和场独立型学生推理成绩不存在显著差异,学过和未学过逻辑学的学生推理成绩也不存在显著差异,但男生和女生推理成绩差异显著,女生比男生更易受“气氛”的影响。(2)在命题推理中,对抽象材料构成的命题,场独立型学生和场依存型学生的推理存在显著差异,场独立型学生表现出更强的证伪倾向,场依存型学生表现出更强的换位倾向;对具体材料构成的命题,场独立型学生和场依存型学生的推理不存在显著差异。 相似文献
164.
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 相似文献
165.
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 相似文献
166.
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 相似文献
167.
Yoshihito Tanaka 《Studia Logica》2007,86(1):111-131
It is known that for any subdirectly irreducible finite Heyting algebra A and any Heyting algebra B, A is embeddable into a quotient algebra of B, if and only if Jankov’s formula χ
A
for A is refuted in B. In this paper, we present an infinitary extension of the above theorem given by Jankov. More precisely, for any cardinal
number κ, we present Jankov’s theorem for homomorphisms preserving infinite meets and joins, a class of subdirectly irreducible
complete κ-Heyting algebras and κ-infinitary logic, where a κ-Heyting algebra is a Heyting algebra A with # ≥ κ and κ-infinitary
logic is the infinitary logic such that for any set Θ of formulas with # Θ ≥ κ, ∨Θ and ∧Θ are well defined formulas. 相似文献
168.
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. 相似文献
169.
170.