Interrogatives, Recursion, and Incompleteness

Wiśniewski, Andrzej; Pogonowski, Jerzy

doi:10.1093/logcom/exq014

Search citation statements

Order By: Relevance

Paper Sections

Select...

The Aim1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2011

2016

Publication Types

Select...

Article2

Other1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, a radical reductionism of this kind leads to serious difficulties (cf. [13,14]). When questions are reduced to sets of PPAs, PMC in its current form constitutes an axiomatic system for question evocation.…”

Section: The Aimmentioning

confidence: 99%

An Axiomatic Account of Question Evocation: The Propositional Case

Wiśniewski¹

2016

Axioms

View full text Add to dashboard Cite

show abstract

Section: The Aimmentioning

confidence: 99%

An Axiomatic Account of Question Evocation: The Propositional Case

Wiśniewski¹

2016

Axioms

View full text Add to dashboard Cite

show abstract

“…In our paper we will make use of some elementary concepts of recursion theory and of a certain recent result in the (metatheory of the) logic of questions (cf. Wiśniewski and Pogonowski 2010). Our approach differs from the mentioned ones not only in the formal method used.…”

mentioning

confidence: 94%

Turing Interrogative Games

Łupkowski

Wiśniewski

2011

Minds & Machines

View full text Add to dashboard Cite

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. Keywords Turing test Á Logic of questions Á Interrogative games Á Recursion theory The Turing Test Despite its years, the Turing Test (TT) still brings in new issues, and the dispute over it is far from being closed; see for example the latest collection of papers (Epstein et al. 2009). One of the central topics in this area is the problem of adequacy of TT as a tool for investigating if artificial agents think. 1 Our aim is to address this issue by using a certain formal approach. Papers devoted to TT most often are philosophical in nature and methods used. Among recent papers notable exceptions are: Turing Machines approach (Sato and Ikegami 2004), exploring the computational complexity of TT setting (Hernandez-Orallo 2000), applying the interactive proof theory in modeling TT (Bradford and

show abstract

Semantics of Questions

Wiśniewski¹

2015

The Handbook of Contemporary Semantic Theory

View full text Add to dashboard Cite

Interrogatives, Recursion, and Incompleteness

Cited by 3 publications

References 1 publication

An Axiomatic Account of Question Evocation: The Propositional Case

An Axiomatic Account of Question Evocation: The Propositional Case

Turing Interrogative Games

Semantics of Questions

Contact Info

Product

Resources

About