The standard way of representing an epistemic state in formal philosophy is in terms of a set of sentences, corresponding to the agent’s beliefs, and an ordering of those sentences, reflecting how well entrenched they are in the agent’s epistemic state. We argue that this wide-spread representational view – a view that we identify as a “Quinean dogma” – is incapable of making certain crucial distinctions. We propose, as a remedy, that any adequate representation of epistemic states must also include (...) the agent’s research agenda, i.e., the list of question that are open or closed at any given point in time. If the argument of the paper is sound, a person’s questions and practical interests, on the one hand, and her beliefs and theoretical values, on the other, are more tightly interwoven than has previously been assumed to be the case in formal epistemology. (shrink)

The issue of adequacy of the Turing Test (TT) is addressed. The concept of Turing Interrogative Game (TIG) is introduced. We show that if some conditions hold, then each machine, even a thinking one, loses a certain TIG and thus an instance of TT. If, however, the conditions do not hold, the success of a machine need not constitute a convincing argument for the claim that the machine thinks.

My aim in this paper is to use a formal approach to the Turing test. This approach is based on a tool developed within Inferential Erotetic Logic, so called erotetic search scenarios. First, I reconstruct the setting of the Turing test proposed by A.M. Turing. On this basis, I build a model of the test using erotetic search scenarios framework. I use the model to investigate one of the most interesting issues of the TT setting – the interrogator’s perspective and (...) role in the test. (shrink)

The concept of search scenario is explicated in terms of erotetic logic, i.e., the logic of questions. Different kinds of erotetic search scenarios are characterized. The basic logical properties of erotetic search scenarios are analyzed.

Olsson and his collaborators have proposed an extension of Belief Revision Theory where an epistemic state is modeled as a triple S=⟨K_,E,A_⟩ , where A_ is a research agenda, i.e. a set of research questions. Contraction and expansion apply to states, and affect the agenda. We propose an alternative characterization of the problem of agenda updating, where research questions are viewed as blueprints for research strategies. We offer a unified solution to this problem, and prove it equivalent to Olsson’s own. (...) We conclude arguing that: (i) our solution makes the idea of ‘minimal change’ in questions and agendas clearer; (ii) can be extended in ways the original theory was not, and may help better realize the aims this theory was proposed for; (iii) unveils some limitations of the initial approach, yet opening a way to overcome them. (shrink)