全文获取类型
收费全文 | 247篇 |
免费 | 5篇 |
国内免费 | 10篇 |
专业分类
262篇 |
出版年
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 10篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 5篇 |
2011年 | 2篇 |
2010年 | 7篇 |
2009年 | 10篇 |
2008年 | 15篇 |
2007年 | 16篇 |
2006年 | 23篇 |
2005年 | 27篇 |
2004年 | 16篇 |
2003年 | 13篇 |
2002年 | 16篇 |
2001年 | 16篇 |
2000年 | 15篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 21篇 |
1996年 | 7篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有262条查询结果,搜索用时 8 毫秒
21.
The fixed point combinator (Y) is an important non-proper combinator, which is defhable from a combinatorially complete base. This combinator guarantees
that recursive equations have a solution. Structurally free logics (LC) turn combinators into formulas and replace structural rules by combinatory ones. This paper introduces the fixed point and
the dual fixed point combinator into structurally free logics. The admissibility of (multiple) cut in the resulting calculus is not provable by a simple adaptation of the similar proof for LC with proper combinators. The novelty of our proof—beyond proving the cut for a newly extended calculus–is that we add a fourth induction to the by-and-large Gentzen-style proof.
Presented by Robert Goldblatt 相似文献
22.
On Some Varieties of MTL-algebras 总被引:1,自引:0,他引:1
23.
Metalogical properties that have traditionally been studied in the deductive system context (see, e.g., [21]) and transferred later to the institution context [33], are here formulated in the -institution context. Preservation under deductive equivalence of -institutions is investigated. If a property is known to hold in all algebraic -institutions and is preserved under deductive equivalence, then it follows that it holds in all algebraizable -institutions in the sense of [36]. 相似文献
24.
Hocine Mouslim Mustapha Belmokaddem Mohamed Benbouziane Sakina Melloul 《Journal of Multi-Criteria Decision Analysis》2014,21(3-4):223-235
The essential activity of a manager is decision making, which is becoming more and more complex, mainly in the multi‐criteria problems. Multi‐choice goal programming (MCGP) is considered as a robust tool in operational research to solve this type of problem. However, in real world problems, determining precise targets for the goals is a difficult task. To deal with such situation, Tabrizi introduced and used in 2012 the concept of membership functions in the MCGP model in order to model the targets fuzziness of each goal. In their model, they considered just only one type of functions (triangular form), which does not reflect adequately the decision maker's preferences that are considered as an essential element for modelling the goal's fuzziness. Their model is called Fuzzy MCGP. In this paper, new ideas are presented to reformulate MCGP model to tackle all types of functions by introducing the (decision maker's) preferences. The concept of indifference thresholds is used in the new formulation for characterizing the imprecision and the preferences associated with all types of the goals. The proposed formulation provides useful insight about the solution of a new class of problems. A numerical example is given to demonstrate the validity and strength of the new formulation. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
25.
Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae
In this paper a unified framework for dealing with a broad family of propositional multimodal logics is developed. The key tools for presentation of the logics are the notions of closure relation operation and monotonous relation operation. The two classes of logics: FiRe-logics (finitely reducible logics) and LaFiRe-logics (FiRe-logics with local agreement of accessibility relations) are introduced within the proposed framework. Further classes of logics can be handled indirectly by means of suitable translations. It is shown that the logics from these classes have the finite model property with respect to the class of -formulae, i.e. each -formula has a -model iff it has a finite -model. Roughly speaking, a -formula is logically equivalent to a formula in negative normal form without occurrences of modal operators with necessity force. In the proof we introduce a substantial modification of Claudio Cerrato's filtration technique that has been originally designed for graded modal logics. The main core of the proof consists in building adequate restrictions of models while preserving the semantics of the operators used to build terms indexing the modal operators. 相似文献
26.
We look at the problem of revising fuzzy belief bases, i.e., belief base revision in which both formulas in the base as well as revision-input formulas can come attached with varying degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy logics, we show how the idea of rational change from “crisp” base revision, as embodied by the idea of partial meet (base) revision, can be faithfully extended to revising fuzzy belief bases. We present and axiomatise an operation of partial meet fuzzy base revision and illustrate how the operation works in several important special instances of the framework. We also axiomatise the related operation of partial meet fuzzy base contraction.This paper is an extended version of a paper presented at the Nineteenth Conference on Uncertainty in Arti.cial Intelligence (UAI’03). 相似文献
27.
28.
《Estudios de Psicología》2013,34(1):85-100
AbstractWe examine some mathematical tools for dealing with ambiguous situations. The main tool is the use of non-standard logic with truth-values in what is called a locale. This approach is related to fuzzy set theory, which we briefly discuss. We also consider probabilistic concepts. We include specific examples and describe the way a researcher can set up a suitable locale to analyse a concrete situation. 相似文献
29.
Giorgio Nardone 《欧洲心理治疗、咨询与健康杂志》2013,15(2):113-127
This paper aims at introducing some of the central aspects of the evolution that brief strategic therapy has undergone at the Centro di Terapia Strategica of Arezzo, Italy, towards advanced therapeutic strategies which differ from the original Palo Alto model. (Fisch, Weakland, &; Segal, 1982; Watzlawick, 1978; Watzlawick, Beavin, &; Jackson, 1967; Watzlawick, Weakland, &; Fisch, 1974). We will focus on how the concept of self-deception is central to the formation and the persistence of psychological disorders; and how the usage of non-ordinary logics and the understanding of the individual's perceptive-reactive system are of key importance in unravelling such disorders, allowing the therapist to guide the patient towards an efficacious and efficient solution. Rather than attempting to describe and enlist the theoretical corpus that underlies brief strategic therapy, we have chosen to exemplify some focal concepts that connect theory to practice, and vice versa, by presenting the outline of some therapeutic protocols devised for solving eating disorders which can be specifically tailored for each individual patient. 相似文献
30.
On the Standard and Rational Completeness of some Axiomatic Extensions of the Monoidal T-norm Logic 总被引:1,自引:0,他引:1
The monoidal t-norm based logic MTL is obtained from Hájek's Basic Fuzzy logic BL by dropping the divisibility condition for the strong (or monoidal) conjunction. Recently, Jenei and Montgana have shown MTL to be standard complete, i.e. complete with respect to the class of residuated lattices in the real unit interval [0,1] defined by left-continuous t-norms and their residua. Its corresponding algebraic semantics is given by pre-linear residuated lattices. In this paper we address the issue of standard and rational completeness (rational completeness meaning completeness with respect to a class of algebras in the rational unit interval [0,1]) of some important axiomatic extensions of MTL corresponding to well-known parallel extensions of BL. Moreover, we investigate varieties of MTL algebras whose linearly ordered countable algebras embed into algebras whose lattice reduct is the real and/or the rational interval [0,1]. These embedding properties are used to investigate finite strong standard and/or rational completeness of the corresponding logics. 相似文献