Jerzy Pogonowski

Interrogatives, Recursion, and Incompleteness

We show that some natural, reasonable assumptions concerning interrogatives and answers yield the existence of recursive sets of sentences which are not sets of direct answers to any interrogative. Our results strengthen Harrah’s incompleteness theorem.We also draw some epistemic consequences from our results.

Diagonalization in Double Frames

We consider structures of the form (Φ, Ψ, R), where Φ and Ψ are non-empty sets and

Remarks on Intended Models of Mathematical Theories

{R\subseteq \Psi\times \Phi}

Co to jest dobry argument? Metoda dyskursu eksperckiego w badaniach nad argumentacją

is a relation whose domain is Ψ. In particular, by using a special kind of a diagonal argument, we prove that if Φ is a denumerable recursive set, Ψ is a denumerable r.e. set, and R is an r.e. relation, then there exists an infinite family of infinite recursive subsets of Φ which are not R-images of elements of Ψ. The proof is a very elementary one, without any reference even to e.g. the

Operacje na argumentacjach

{S_{n}^{m}}

Remarks on Ancient Chinese Logic

-theorem. Some consequences of the main result are also discussed.