We axiomatize Leitgeb’s (2005) theory of truth and show that this theory proves all arithmetical sentences of the system of ramified analysis up to ε0. We also give alternative axiomatizations of Kripke’s (1975) theory of truth (Strong Kleene and supervaluational version) and show that they are at least as strong as the Kripke-Feferman system KF and Cantini’s VF, respectively
Abstract. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point sema...
In Kripke’s classic paper on truth it is argued that by adding a new semantic category different fro...
For any natural (human) or formal (mathematical) language L we know that an expression X of language...
We axiomatize Leitgeb’s (2005) theory of truth and show that this theory proves all arithmetical sen...
Hannes Leitgeb formulated eight norms for theories of truth in his paper [5]: `What Theories of Trut...
This book is a contribution to the flourishing field of formal and philosophical work on truth and t...
This paper compares the roles classical and intuitionistic logic play in restricting the free use of...
A theory of truth is introduced for a first--order language L of set theory. Fully interpreted meta...
In this thesis, we adapt several prominent methods to state consistent axiomatic theories of (type-f...
In this paprer a class of so called mathematically acceptable (shortly MA) languages is introduced F...
It is widely accepted that a theory of truth for arithmetic should be consistent, but ω-consistency ...
In the Tarskian theory of truth, the strengthened liar sentence is a theorem. More generally, any...
In this paper a class of languages which are formal enough for mathematical reasoning is introduced....
Abstract. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point sema...
In Kripke’s classic paper on truth it is argued that by adding a new semantic category different fro...
For any natural (human) or formal (mathematical) language L we know that an expression X of language...
We axiomatize Leitgeb’s (2005) theory of truth and show that this theory proves all arithmetical sen...
Hannes Leitgeb formulated eight norms for theories of truth in his paper [5]: `What Theories of Trut...
This book is a contribution to the flourishing field of formal and philosophical work on truth and t...
This paper compares the roles classical and intuitionistic logic play in restricting the free use of...
A theory of truth is introduced for a first--order language L of set theory. Fully interpreted meta...
In this thesis, we adapt several prominent methods to state consistent axiomatic theories of (type-f...
In this paprer a class of so called mathematically acceptable (shortly MA) languages is introduced F...
It is widely accepted that a theory of truth for arithmetic should be consistent, but ω-consistency ...
In the Tarskian theory of truth, the strengthened liar sentence is a theorem. More generally, any...
In this paper a class of languages which are formal enough for mathematical reasoning is introduced....
Abstract. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point sema...
In Kripke’s classic paper on truth it is argued that by adding a new semantic category different fro...
For any natural (human) or formal (mathematical) language L we know that an expression X of language...