Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Cezary Cieśliński"'
Autor:
Cezary Cieśliński
Publikováno v:
Studia Semiotyczne, Vol 28, Iss 1 (2020)
DOI: http://doi.org/10.26333/sts.xxviii.05 Prof. Barbara Stanosz była wieloletnią wykładowczynią Instytutu Filozofii Uniwersytetu Warszawskiego. W swej pracy naukowej zajmowała się głównie – choć nie wyłącznie – teorią języka, w s
Externí odkaz:
https://doaj.org/article/778987f703204b8aba26f398b46ac1fa
Autor:
Cezary Cieśliński
This book analyses and defends the deflationist claim that there is nothing deep about our notion of truth. According to this view, truth is a'light'and innocent concept, devoid of any essence which could be revealed by scientific inquiry. Cezary Cie
Publikováno v:
The Review of Symbolic Logic. :1-16
We formulate and explore two basic axiomatic systems of type-free subjective probability. One of them explicates a notion of finitely additive probability. The other explicates a concept of infinitely additive probability. It is argued that the first
Autor:
Cezary Cieśliński
Publikováno v:
Archive for Mathematical Logic. 60:749-770
We present a construction of a truth class (an interpretation of a compositional truth predicate) in an arbitrary countable recursively saturated model of first-order arithmetic. The construction is fully classical in that it employs nothing more tha
Ali Enayat had asked whether two halves of Disjunctive Correctness ([Formula: see text]) for the compositional truth predicate are conservative over Peano Arithmetic (PA). In this paper, we show that the principle “every true disjunction has a true
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75bf0ca86c70780e3a1645f395877d82
Autor:
Cezary Cieśliński
Publikováno v:
Logic and Its Applications ISBN: 9783662587706
ICLA
ICLA
We present a construction of a satisfaction class in an arbitrary countable recursively saturated models of first-order arithmetic. Our construction is fully classical, namely, it employs nothing more than the classical techniques of formal proof the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2e50f107f870d0f4180c7944532b3db
https://doi.org/10.1007/978-3-662-58771-3_12
https://doi.org/10.1007/978-3-662-58771-3_12
Publikováno v:
The Review of Symbolic Logic. 10:187-202
We show that a typed compositional theory of positive truth with internal induction for total formulae (denoted by PTtot) is not semantically conservative over Peano arithmetic. In addition, we observe that the class of models of PA expandable to mod
Autor:
Cezary Cieśliński
Publikováno v:
Synthese. 195:1077-1101
Disquotational theories of truth are often criticised for being too weak to prove interesting generalisations about truth. In this paper we will propose a certain formal theory to serve as a framework for a solution of the generalisation problem. In
Autor:
Cezary Cieśliński
Publikováno v:
Dialectica. 69:61-85
One of the popular explications of the deflationary tenet of ‘thinness’ of truth is the conservativeness demand: the declaration that a deflationary truth theory should be conservative over its base. This paper contains a critical discussion and