Add to ORKGA theory T is trustworthy iff, whenever a theory U is interpretable in T, then it is faithfully interpretable. In this paper we provide a characterization of trustworthiness. We provide a simple proof of Friedman’s Theorem that finitely axiomatized, sequential, consistent theories are trustworthy. We provide an example of a theory whose schematic predicate logic is complete II0
AbstractDzhaparidze, G., A generalized notion of weak interpretability and the corresponding modal l...
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...
AbstractA theory T is trustworthy iff, whenever a theory U is interpretable in T, then it is faithfu...
In this paper we study the combined structure of the relations of theory-extension and interpretabil...
In this paper we study the combined structure of the relations of theory-extension and interpretabil...
Interpreting reflexive theories in finitely many axioms by V. Yu. S h a v r u k o v (Utrecht) Abstra...
Abstract. In this paper, we provide a formal framework for studying the empirical content of a given...
In the present paper, we explore an idea of Harvey Friedman to obtain a coordinate-free presentation...
This paper proposes a notion of finitely-verifiable classes of sentences. Informally, a class of sen...
A miracle happens. In one hand we have a class of marvelously complex theories in predicate logic, ...
I argue that trustworthiness is an epistemic desideratum. It does not reduce to justified or reliabl...
Reliabilists hold that a belief is doxastically justified if and only if it is caused by a reliable ...
Constructing description logic ontologies is a difficult task that is normally conducted by experts....
In this work, we provide a logical characterization of trust, which is based on a modal logic expres...
AbstractDzhaparidze, G., A generalized notion of weak interpretability and the corresponding modal l...
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...
AbstractA theory T is trustworthy iff, whenever a theory U is interpretable in T, then it is faithfu...
In this paper we study the combined structure of the relations of theory-extension and interpretabil...
In this paper we study the combined structure of the relations of theory-extension and interpretabil...
Interpreting reflexive theories in finitely many axioms by V. Yu. S h a v r u k o v (Utrecht) Abstra...
Abstract. In this paper, we provide a formal framework for studying the empirical content of a given...
In the present paper, we explore an idea of Harvey Friedman to obtain a coordinate-free presentation...
This paper proposes a notion of finitely-verifiable classes of sentences. Informally, a class of sen...
A miracle happens. In one hand we have a class of marvelously complex theories in predicate logic, ...
I argue that trustworthiness is an epistemic desideratum. It does not reduce to justified or reliabl...
Reliabilists hold that a belief is doxastically justified if and only if it is caused by a reliable ...
Constructing description logic ontologies is a difficult task that is normally conducted by experts....
In this work, we provide a logical characterization of trust, which is based on a modal logic expres...
AbstractDzhaparidze, G., A generalized notion of weak interpretability and the corresponding modal l...
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...