排序方式: 共有6条查询结果,搜索用时 15 毫秒
1
1.
2.
LIU Jingxian 《Frontiers of Philosophy in China》2012,7(3):367
Richard Heck and John Burgess have shown that Frege’s Basic Law V is consistent with predicative comprehension and that the resulting theory interprets Robinson Arithmetic. There are also many other ways to keep Frege from being contradictory. This paper shows that Basic Law V is also consistent with positive comprehension and that the resulting theory also interprets Robinson Arithmetic. In addition, the theory of positive Frege provides a new understanding of Dummett’s “indefinitely extensible concepts.” 相似文献
3.
There is a little known paradox the solution to which is a guide to a much more thoroughgoing solution to a whole range of classic paradoxes. This is shown in this paper with respect to Berrys Paradox, Heterologicality, Russells Paradox, and the Paradox of Predication, also the Liar and the Strengthened Liar, using primarily the epsilon calculus. The solutions, however, show not only that the first-order predicate calculus derived from Frege is inadequate as a basis for a clear science, and should be replaced with Hilbert and Bernays conservative extension. Standard second-order logic, and quantified propositional logic also must be substantially modified, to incorporate, in the first place, nominalizations of predicates, and whole sentences. And further modifications must be made, so as to insist that predicates are parts of sentences rather than forms of them, and that truth is a property of propositions rather than their sentential expressions. In all, a thorough reworking of what has been called logic in recent years must be undertaken, to make it more fit for use.Portions of this paper have previously been published in Logical Studies, vol. 9, http://www.logic.ru/LogStud/09/No9-06.html, and the Australasian Journal of Logic, vol. 2, http://www.philosophy.unimelb.edu.au/ajl/2004/2004_4.pdf. 相似文献
4.
5.
Two extensions of the structurally free logic LC 总被引:1,自引:0,他引:1
6.
Commuting conversions were introduced in the natural deduction calculus as ad hoc devices for the purpose of guaranteeing the subformula property in normal proofs. In a well known book, Jean-Yves Girard
commented harshly on these conversions, saying that ‘one tends to think that natural deduction should be modified to correct
such atrocities.’ We present an embedding of the intuitionistic predicate calculus into a second-order predicative system
for which there is no need for commuting conversions. Furthermore, we show that the redex and the conversum of a commuting conversion of the original calculus translate into equivalent derivations by means of a series of bidirectional
applications of standard conversions.
Presented by Heinrich Wansing and Jacek Malinowski 相似文献
1