全文获取类型
收费全文 | 971篇 |
免费 | 23篇 |
国内免费 | 8篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 15篇 |
2019年 | 12篇 |
2018年 | 7篇 |
2017年 | 6篇 |
2016年 | 33篇 |
2015年 | 10篇 |
2014年 | 20篇 |
2013年 | 49篇 |
2012年 | 9篇 |
2011年 | 5篇 |
2010年 | 10篇 |
2009年 | 47篇 |
2008年 | 75篇 |
2007年 | 77篇 |
2006年 | 62篇 |
2005年 | 76篇 |
2004年 | 60篇 |
2003年 | 61篇 |
2002年 | 60篇 |
2001年 | 46篇 |
2000年 | 65篇 |
1999年 | 40篇 |
1998年 | 34篇 |
1997年 | 36篇 |
1996年 | 25篇 |
1995年 | 21篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
排序方式: 共有1002条查询结果,搜索用时 15 毫秒
931.
We consider two topological interpretations of the modal diamond—as the closure operator (C-semantics) and as the derived set operator (d-semantics). We call the logics arising from these interpretations C-logics and d-logics, respectively. We axiomatize a number of subclasses of the class of nodec spaces with respect to both semantics, and
characterize exactly which of these classes are modally definable. It is demonstrated that the d-semantics is more expressive than the C-semantics. In particular, we show that the d-logics of the six classes of spaces considered in the paper are pairwise distinct, while the C-logics of some of them coincide.
Mathematics Subject Classifications (2000): 03B45, 54G99.
Presented by Michael Zakharyaschev 相似文献
932.
-autonomous lattices are the algebraic exponentials and without additive constants. In this paper, we investigate the structure theory of this variety and some of its subvarieties, as well as its relationships with other classes of algebras. 相似文献
933.
An operation on inferential rules, called H-operation, is used to minimize the axiom basis for classical logic. 相似文献
934.
We prove that all finitely axiomatizable tense logics with temporal operators for ‘always in the future’ and ‘always in the
past’ and determined by linear fows time are coNP-complete. It follows, for example, that all tense logics containing a density
axiom of the form ■n+1F p → nF p, for some n ≥ 0, are coNP-complete. Additionally, we prove coNP-completeness of all ∩-irreducible tense logics. As these classes of tense
logics contain many Kripke incomplete bimodal logics, we obtain many natural examples of Kripke incomplete normal bimodal
logics which are nevertheless coNP-complete. 相似文献
935.
Compactness is an important property of classical propositional logic. It can be defined in two equivalent ways. The first one states that simultaneous satisfiability of an infinite set of formulae is equivalent to the satisfiability of all its finite subsets. The second one states that if a set of formulae entails a formula, then there is a finite subset entailing this formula as well.In propositional many-valued logic, we have different degrees of satisfiability and different possible definitions of entailment, hence the questions of compactness is more complex. In this paper we will deal with compactness of Gödel, GödelΔ, and Gödel~ logics.There are several results (all for the countable set of propositional variables) concerning the compactness (based on satisfiability) of these logic by Cintula and Navara, and the question of compactness (based on entailment) for Gödel logic was fully answered by Baaz and Zach (see papers [3] and [2]).In this paper we give a nearly complete answer to the problem of compactness based on both concepts for all three logics and for an arbitrary cardinality of the set of propositional variables. Finally, we show a tight correspondence between these two concepts 相似文献
936.
We propose a new, rather simple and short proof of Kripke-completeness for the predicate variant of Dummett's logic. Also
a family of Kripke-incomplete extensions of this logic that are complete w.r.t. Kripke frames with equality (or equivalently,
w.r.t. Kripke sheaves [8]), is described. 相似文献
937.
938.
We show that it is possible to base fuzzy control on fuzzy logic programming. Indeed, we observe that the class of fuzzy Herbrand interpretations gives a semantics for fuzzy programs and we show that the fuzzy function associated with a fuzzy system of IF-THEN rules is the fuzzy Herbrand interpretation associated with a suitable fuzzy program. 相似文献
939.
D. M. Gabbay 《Journal of Philosophical Logic》2002,31(3):211-243
A hypermodality is a connective whose meaning depends on where in the formula it occurs. The paper motivates the notion and shows that hypermodal logics are much more expressive than traditional modal logics. In fact we show that logics with very simple K hypermodalities are not complete for any neighbourhood frames. 相似文献
940.
In Coecke (2002) we proposed the intuitionistic or disjunctive representation of quantum logic, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these properties, where this complete Heyting algebra goes equipped with an additional operation, the operational resolution, which identifies the properties within the logic of propositions. This representation has an important application towards dynamic quantum logic, namely in describing the temporal indeterministic propagation of actual properties of physical systems. This paper can as such by conceived as an addendum to Quantum Logic in Intuitionistic Perspective that discusses spin-off and thus provides an additional motivation. We derive a quantaloidal semantics for dynamic disjunctive quantum logic and illustrate it for the particular case of a perfect (quantum) measurement. 相似文献