首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   56篇
  免费   0篇
  2019年   3篇
  2017年   1篇
  2014年   1篇
  2013年   1篇
  2012年   4篇
  2011年   4篇
  2009年   5篇
  2008年   4篇
  2007年   2篇
  2006年   6篇
  2004年   1篇
  2003年   2篇
  2000年   1篇
  1999年   1篇
  1998年   3篇
  1997年   1篇
  1995年   1篇
  1991年   1篇
  1990年   1篇
  1987年   1篇
  1985年   1篇
  1984年   3篇
  1983年   1篇
  1982年   2篇
  1980年   1篇
  1979年   1篇
  1978年   2篇
  1974年   1篇
排序方式: 共有56条查询结果,搜索用时 31 毫秒
11.
12.
13.
14.
Modal Foundations for Predicate Logic   总被引:1,自引:0,他引:1  
  相似文献   
15.
Johan van Benthem 《Synthese》1982,51(3):431-472
The relation between logic and philosophy of science, often taken for granted, is in fact problematic. Although current fashionable criticisms of the usefulness of logic are usually mistaken, there are indeed difficulties which should be taken seriously — having to do, amongst other things, with different scientific mentalities in the two disciplines (section 1). Nevertheless, logic is, or should be, a vital part of the theory of science. To make this clear, the bulk of this paper is devoted to the key notion of a scientific theory in a logical perspective. First, various formal explications of this notion are reviewed (section 2), then their further logical theory is discussed (section 3). In the absence of grand inspiring programs like those of Klein in mathematics or Hilbert in metamathematics, this preparatory ground-work is the best one can do here. The paper ends on a philosophical note, discussing applicability and merits of the formal approach to the study of science (section 4).I would like to thank David Pearce and Veikko Rantala for their helpful comments.  相似文献   
16.
In the modal literature various notions of completeness have been studied for normal modal logics. Four of these are defined here, viz. (plain) completeness, first-order completeness, canonicity and possession of the finite model property — and their connections are studied. Up to one important exception, all possible inclusion relations are either proved or disproved. Hopefully, this helps to establish some order in the jungle of concepts concerning modal logics. In the course of the exposition, the interesting properties of first-order definability and preservation under ultrafilter extensions are introduced and studied as well.  相似文献   
17.
Contemporary historians of logic tend to credit Bernard Bolzano with the invention of the semantic notion, of consequence, a full century before Tarski. Nevertheless, Bolzano's work played no significant rôle in the genesis of modern logical semantics. The purpose of this paper is to point out three highly original, and still quite relevant themes in Bolzano's work, being a systematic study of possible types of inference, of consistency, as well as their meta-theory. There are certain analogies with Tarski's concerns here, although the main thrust seems to be different, both philosophically and technically. Thus, if only obliquely, we also provide some additional historical perspective on Tarski's achievement.  相似文献   
18.
19.
Van Benthem  Johan 《Studia Logica》1998,60(2):311-330
It has been known since the seventies that the formulas of modal logic are invariant for bisimulations between possible worlds models — while conversely, all bisimulation-invariant first-order formulas are modally definable. In this paper, we extend this semantic style of analysis from modal formulas to dynamic program operations. We show that the usual regular operations are safe for bisimulation, in the sense that the transition relations of their values respect any given bisimulation for their arguments. Our main result is a complete syntactic characterization of all first-order definable program operations that are safe for bisimulation. This is a semantic functional completeness result for programming, which may be contrasted with the more usual analysis in terms of computational power. The 'Safety Theorem' can be modulated in several ways. We conclude with a list of variants, extensions, and further developments.  相似文献   
20.
Of the various notions of reduction in the logical literature, relative interpretability in the sense of Tarskiet al. [6] appears to be the central one. In the present note, this syntactic notion is characterized semantically, through the existence of a suitable reduction functor on models. The latter mathematical condition itself suggests a natural generalization, whose syntactic equivalent turns out to be a notion of interpretability quite close to that of Ershov [1], Szczerba [5] and Gaifman [2]. This author's contribution was completed during a fellowship held at The Netherlands Institute for Advanced Study, 1982–3. Both authors would like to thank Wilfrid Hodges for his valuable comments and advice concerning an earlier version of this paper.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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