Add to ORKGA theory of truth is introduced for a first--order language L of set theory. Fully interpreted metalanguages which contain their truth predicates are constructed for L. The presented theory is free from infinite regress, whence it provides a proper framework to study the regress problem. Only ZF set theory, concepts definable in L and classical two-valued logic are used
We axiomatize Leitgeb’s (2005) theory of truth and show that this theory proves all arithmetical sen...
Every countable language which conforms to classical logic is shown to have an extension which has ...
Two types of logical consequence are compared: one, with respect to matrix and designated elements a...
A theory of truth is introduced for a first--order language L of set theory. Fully interpreted meta...
A theory of truth is introduced for a countable model of ZF set theory. It is free from infinite reg...
In this paper a class of languages which are formal enough for mathematical reasoning is introduced....
In this paprer a class of so called mathematically acceptable (shortly MA) languages is introduced F...
Hannes Leitgeb formulated eight norms for theories of truth in his paper [5]: `What Theories of Trut...
A theory of truth is introduced for a model $M$ ZF set theory. Its inner and outer logics are class...
Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a full...
We axiomatize Leitgeb’s (2005) theory of truth and show that this theory proves all arithmetical sen...
Every countable language which conforms to classical logic is shown to have an extension which has ...
Two types of logical consequence are compared: one, with respect to matrix and designated elements a...
A theory of truth is introduced for a first--order language L of set theory. Fully interpreted meta...
A theory of truth is introduced for a countable model of ZF set theory. It is free from infinite reg...
In this paper a class of languages which are formal enough for mathematical reasoning is introduced....
In this paprer a class of so called mathematically acceptable (shortly MA) languages is introduced F...
Hannes Leitgeb formulated eight norms for theories of truth in his paper [5]: `What Theories of Trut...
A theory of truth is introduced for a model $M$ ZF set theory. Its inner and outer logics are class...
Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a full...
We axiomatize Leitgeb’s (2005) theory of truth and show that this theory proves all arithmetical sen...
Every countable language which conforms to classical logic is shown to have an extension which has ...
Two types of logical consequence are compared: one, with respect to matrix and designated elements a...