首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   16篇
  免费   0篇
  2020年   1篇
  2018年   1篇
  2013年   2篇
  2012年   1篇
  2010年   1篇
  2005年   2篇
  2003年   3篇
  2002年   1篇
  2000年   2篇
  1998年   2篇
排序方式: 共有16条查询结果,搜索用时 15 毫秒
1.
2.
Intuitionism's disagreement with classical logic is standardly based on its specific understanding of truth. But different intuitionists have actually explicated the notion of truth in fundamentally different ways. These are considered systematically and separately, and evaluated critically. It is argued that each account faces difficult problems. They all either have implausible consequences or are viciously circular.  相似文献   
3.
Raatikainen  Panu 《Synthese》2003,137(1-2):157-177
After sketching the main lines of Hilbert's program, certain well-known andinfluential interpretations of the program are critically evaluated, and analternative interpretation is presented. Finally, some recent developments inlogic related to Hilbert's program are reviewed.  相似文献   
4.
5.
Panu Raatikainen 《Synthese》2012,187(2):569-577
An argument, different from the Newman objection, against the view that the cognitive content of a theory is exhausted by its Ramsey sentence is reviewed. The crux of the argument is that Ramsification may ruin inductive systematization between theory and observation. The argument also has some implications concerning the issue of underdetermination.  相似文献   
6.
Panu Raatikainen 《Synthese》2003,135(1):37-47
Hilary Putnam's famous arguments criticizing Tarski's theory oftruth are evaluated. It is argued that they do not succeed to undermine Tarski's approach. One of the arguments is based on the problematic idea of a false instance of T-schema. The otherignores various issues essential for Tarski's setting such as language-relativity of truth definition.  相似文献   
7.
The prospects and limitations of defining truth in a finite model in the same language whose truth one is considering are thoroughly examined. It is shown that in contradistinction to Tarskirs undefinability theorem for arithmetic, it is in a definite sense possible in this case to define truth in the very language whose truth is in question.  相似文献   
8.
9.
Panu  Raatikainen 《Analysis》2005,65(287):175-177
  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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