首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   80篇
  免费   2篇
  国内免费   10篇
  2022年   1篇
  2021年   1篇
  2020年   3篇
  2019年   3篇
  2018年   5篇
  2017年   2篇
  2016年   2篇
  2015年   1篇
  2014年   4篇
  2013年   8篇
  2012年   2篇
  2011年   2篇
  2010年   1篇
  2009年   5篇
  2008年   7篇
  2007年   3篇
  2006年   6篇
  2005年   8篇
  2004年   9篇
  2003年   6篇
  2002年   3篇
  2001年   2篇
  2000年   3篇
  1999年   1篇
  1997年   1篇
  1992年   3篇
排序方式: 共有92条查询结果,搜索用时 31 毫秒
21.
This work is part of a wider investigation into lattice-structured algebras and associated dual representations obtained via the methodology of canonical extensions. To this end, here we study lattices, not necessarily distributive, with negation operations.We consider equational classes of lattices equipped with a negation operation ¬ which is dually self-adjoint (the pair (¬,¬) is a Galois connection) and other axioms are added so as to give classes of lattices in which the negation is De Morgan, orthonegation, antilogism, pseudocomplementation or weak pseudocomplementation. These classes are shown to be canonical and dual relational structures are given in a generalized Kripke-style. The fact that the negation is dually self-adjoint plays an important role here, as it implies that it sends arbitrary joins to meets and that will allow us to define the dual structures in a uniform way.Among these classes, all but one—that of lattices with a negation which is an antilogism—were previously studied by W. Dzik, E. Or?owska and C. van Alten using Urquhart duality.In some cases in which a given axiom does not imply that negation is dually self-adjoint, canonicity is proven with the weaker assumption of antitonicity of the negation.  相似文献   
22.
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  相似文献   
23.
This article examines efficiency issues pertaining to social marketing messages about behavior enactment (e.g., smoker) vs. non-enactment (e.g., nonsmoker). Building on a wealth of psycholinguistics research, we posit that underlying differences in the processing and storage of word concepts with affixal negations affect learning and memory for these concepts (i.e., associations with non-enactment concepts will be harder to learn and remember than associations with enactment concepts). Two experiments support our predictions, suggesting that messages about enactment will demonstrate superior efficiency. Implications of study findings are discussed in terms of possibilities for improving the efficiency of social marketing messages about non-enactment.  相似文献   
24.
25.
26.
Whether assent (acceptance) and dissent (rejection) are thought of as speech acts or as propositional attitudes, the leading idea of rejectivism is that a grasp of the distinction between them is prior to our understanding of negation as a sentence operator, this operator then being explicable as applying to A to yield something assent to which is tantamount to dissent from A. Widely thought to have been refuted by an argument of Frege"s, rejectivism has undergone something of a revival in recent years, especially in writings by Huw Price and Timothy Smiley. While agreeing that Frege"s argument does not refute the position, we shall air some philosophical qualms about it in Section 5, after a thorough examination of the formal issues in Sections 1–4. This discussion draws on – and seeks to draw attention to – some pertinent work of Kent Bendall in the 1970s.  相似文献   
27.
Adding Involution to Residuated Structures   总被引:4,自引:2,他引:2  
Galatos  Nikolaos  Raftery  James G. 《Studia Logica》2004,77(2):181-207
Two constructions for adding an involution operator to residuated ordered monoids are investigated. One preserves integrality and the mingle axiom x 2x but fails to preserve the contraction property xx 2. The other has the opposite preservation properties. Both constructions preserve commutativity as well as existent nonempty meets and joins and self-dual order properties. Used in conjunction with either construction, a result of R.T. Brady can be seen to show that the equational theory of commutative distributive residuated lattices (without involution) is decidable, settling a question implicitly posed by P. Jipsen and C. Tsinakis. The corresponding logical result is the (theorem-) decidability of the negation-free axioms and rules of the logic RW, formulated with fusion and the Ackermann constant t. This completes a result of S. Giambrone whose proof relied on the absence of t.  相似文献   
28.
29.
本文尝试从现象学的生活世界观点出发,对黑格尔《精神现象学》之“感性确定性分析”中的动作性词语作一个解释学的解读工作,以便发掘出黑格尔辩证法之中介游戏或者间接同一性机制所以可能发生的动态的源初“地带”。  相似文献   
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号