Erotetic Logic

This paper contributes to the calculization of evocation and erotetic implication as defined by Inferential Erotetic Logic (IEL). There is a straightforward approach to calculizing (propositional) erotetic implication which cannot be applied to evocation. First-order evocation is proven to be uncalculizable, i.e. there is no proof system, say FOE, such that for all X, Q: X evokes Q iff there is an FOE-proof for the evocation of Q by X. These results suggest a critique of the represented approaches to calculizing (...) IEL. This critique is expanded into a programmatic reconsideration of the IEL-definitions of evocation and erotetic implication. From a different point of view these definitions should be seen as desiderata that may or may not play the role of a point of orientation when setting up "rules of asking". (shrink)

The study of defeasible reasoning unites epistemologists with those working in AI, in part, because both are interested in epistemic rationality. While it is traditionally thought to govern the formation and (with)holding of beliefs, epistemic rationality may also apply to the interrogative attitudes associated with our core epistemic practice of inquiry, such as wondering, investigating, and curiosity. Since generally intelligent systems should be capable of rational inquiry, AI researchers have a natural interest in the norms that govern interrogative attitudes. Following (...) its recent coinage, we use the term ``zetetic'' to refer to the properties and norms associated with the capacity to inquire. In this paper, we argue that zetetic norms can be modeled via defeasible inferences to and from questions---a.k.a erotetic inferences---in a manner similar to the way norms of epistemic rationality are represented by defeasible inference rules. We offer a sequent calculus that accommodates the unique features of ``erotetic defeat" and that exhibits the computational properties needed to inform the design of zetetic agents. The calculus presented here is an improved version of the one presented in Millson (2019), extended to cover a new class of defeasible erotetic inferences. (shrink)

In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and dependencies to this classical core. In this paper, we broaden the scope of these investigations by studying questions and dependency in the context of intuitionistic logic. We propose an intuitionistic team semantics, where teams are embedded within intuitionistic Kripke models. (...) The associated logic is a conservative extension of intuitionistic logic with questions and dependence formulas. We establish a number of results about this logic, including a normal form result, a completeness result, and translations to classical inquisitive logic and modal dependence logic. (shrink)

People sometimes argue for questions, as can be verified by a Web search using as search terms phrases consisting of a conclusion indicator and an interrogative particle. These arguments provide a reason for asking the question and thus try to establish that it needs to be answered. Typically, they do so either in order to motivate interest in discovering the answer or in order to challenge addressees or a third party to explain their behaviour. The “inferential erotetic logic” of the (...) Polish logician Andrzej Wiśniewski provides a basis for evaluating the inferences in such arguments. For an inference from one or more statements to a question to be valid, the statements and the context must entail that the question has a true answer without entailing that any particular answer is true. Further, there must be a point to asking the question, such as the addressees’ ignorance of the correct answer to it; this requirement may be a pragmatic rather than a semantic constraint. Wiśniewski’s logic also covers inferences from questions to questions, but humans rarely articulate such inferences; this part of his logic is applicable to problem solving and proof theory rather than to arguments for questions. (shrink)

This paper introduces the inquisitive extension of R, denoted as InqR, which is a relevant logic of questions based on the logic R as the background logic of declaratives. A semantics for InqR is developed, and it is shown that this semantics is, in a precisely defined sense, dual to Routley-Meyer semantics for R. Moreover, InqR is axiomatized and completeness of the axiomatic system is established. The philosophical interpretation of the duality between Routley-Meyer semantics and the semantics for InqR is (...) also discussed. (shrink)

Classical first-order logic \ is commonly used to study logical connections between statements, that is sentences that in every context have an associated truth-value. Inquisitive first-order logic \ is a conservative extension of \ which captures not only connections between statements, but also between questions. In this paper we prove the disjunction and existence properties for \ relative to inquisitive disjunction Open image in new window and inquisitive existential quantifier \. Moreover we extend these results to several families of theories, (...) among which the one in the language of \. To this end, we initiate a model-theoretic approach to the study of \. In particular, we develop a toolkit of basic constructions in order to transform and combine models of \. (shrink)

In recent years, the effort to formalize erotetic inferences—i.e., inferences to and from questions—has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic : erotetic evocation and erotetic implication. While an effort has been made to axiomatize the former in a sequent (...) system, there is currently no proof theory for the latter. Moreover, the extant axiomatization of erotetic evocation fails to capture its defeasible character and provides no rules for introducing or eliminating question-forming operators. In contrast, our calculus encodes defeasibility conditions on sequents and provides rules governing the introduction and elimination of erotetic formulas. We demonstrate that an elimination theorem holds for a version of the cut rule that applies to both declarative and erotetic formulas and that the rules for the axiomatic account of question evocation in IEL are admissible in our system. (shrink)

In recent years, the e ffort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and regular erotetic implication. While an attempt has been made to (...) axiomatize the former in a sequent system, there is currently no proof theory for the latter. Moreover, the extant axiomatization of erotetic evocation fails to capture its defeasible character and provides no rules for introducing or eliminating question-forming operators. In contrast, our calculus encodes defeasibility conditions on sequents and provides rules governing the introduction and elimination of erotetic formulas. We demonstrate that an elimination theorem holds for a version of the cut rule that applies to both declarative and erotetic formulas and that the rules for the axiomatic account of question evocation in IEL are admissible in our system. (shrink)

The concepts of question evocation and erotetic implication play central role in Inferential Erotetic Logic. In this paper, deduction theorems for question evocation and erotetic implication are proven. Moreover, it is shown how question evocation by a finite non-empty set of declaratives can be reduced to question evocation by the empty set, and how erotetic implication based on a finite non-empty set of declaratives can be reduced to a relation between questions only.

Traditional approaches to the semantics of questions analyze questions indirectly, via the notion of an answer. In recent work on inquisitive semantics, a different perspective is taken: the meaning of a question is equated with its resolution conditions, just like the meaning of a statement is traditionally equated with its truth-conditions. In this paper I argue that this proposal improves on previous approaches, combining the formal elegance and explanatory power of Groenendijk and Stokhof’s partition theory with the greater generality afforded (...) by answer-set theories. (shrink)

FFormal dialogue system for tutorials DLT is introduced. The system allows for modelling certain behaviours related to questioning agendas observed in tutorial dialogues. Inferential Erotetic Logic is the underlying logic of questions used here. Tutorial dialogues retrieved from the Basic Electricity and Electronics Corpus are presented and analysed with the use of DLT.

The traditional use of the expression 'pseudoproblem' is analysed in order to clarify the talk of pseudoproblems and related phenomena. The goal is to produce a philosophically serviceable terminology that stays true to its historical roots. This explicative study is inspired by and makes use of the method of logical reconstruction. Since pseudoproblems are usually expressed by pseudoquestions a formal language of questions is presented as a possible reconstruction language for alleged pseudoproblems. The study yields an informal theory of pseudoproblems (...) whose presuppositions are critically investigated right away. At least one result remains: Claims of pseudoproblemship and their refutations must not be voiced casually - they are to be relativized and need substantial interpretive effort. (shrink)

Our aim is to model the behaviour of a cognitive agent trying to solve a complex problem by dividing it into sub-problems, but failing to solve some of these sub-problems. We use the powerful framework of erotetic search scenarios combined with Kleene’s strong three-valued logic. ESS, defined on the grounds of Inferential Erotetic Logic, has appeared to be a useful logical tool for modelling cognitive goal-directed processes. Using the logical tools of ESS and the three-valued logic, we will show how (...) an agent could solve the initial problem despite the fact that the sub-problems remain unsolved. Thus our model not only indicates missing information but also specifies the contexts in which the problem-solving process may end in success despite the lack of information. We will also show that this model of problem solving may find use in an analysis of natural language dialogues. (shrink)

An erotetic calculus for a given logic constitutes a sequent-style proof-theoretical formalization of the logic grounded in Inferential Erotetic Logic ). In this paper, a new erotetic calculus for Classical Propositional Logic ), dual with respect to the existing ones, is given. We modify the calculus to obtain complete proof systems for the propositional part of paraconsistent logic \ and its extensions \ and \. The method is based on dual resolution. Moreover, the resolution rule is non-clausal. According to the (...) authors knowledge, this is the first account of resolution for \. Last but not least, as the method is grounded in \, it constitutes an important tool for the so-called question-processing. (shrink)

An erotetic calculus for a given logic constitutes a sequent-style proof-theoretical formalization of the logic grounded in Inferential Erotetic Logic. In this paper, a new erotetic calculus for Classical Propositional Logic, dual with respect to the existing ones, is given. We modify the calculus to obtain complete proof systems for the propositional part of paraconsistent logic $${\mathsf{CLuN}}$$ CLuN and its extensions $${\mathsf{CLuNs}}$$ CLuNs and $${\mathsf{mbC}}$$ mbC. The method is based on dual resolution. Moreover, the resolution rule is non-clausal. According to (...) the authors knowledge, this is the first account of resolution for $${\mathsf{mbC}}$$ mbC. Last but not least, as the method is grounded in $${\mathsf{IEL}}$$ IEL, it constitutes an important tool for the so-called question-processing. (shrink)

Inferential erotetic logic and inquisitive semantics give accounts of questions and model various aspects of questioning. In this paper we concentrate upon connections between inquisitiveness, being the core concept of INQ, and question raising, characterized in IEL by means of the concepts of question evocation and erotetic implication. We consider the basic system InqB of INQ, remain at the propositional level and show, inter alia, that: a disjunction of all the direct answers to an evoked question is always inquisitive; a (...) formula is inquisitive if, and only if it evokes a yes–no question whose affirmative answer expresses a possibility for the formula; inquisitive formulas evoke questions whose direct answers express all the possibilities for the formulas, and each question erotetically implies a question whose direct answers express the possibilities for the direct answers to the implying question. (shrink)

The concept of cooperative question-responses as an extension of cooperative behaviours used by interfaces for databases and information systems is proposed. A procedure to generate question-responses based on question dependency and erotetic search scenarios is presented. The procedure is implemented in Prolog.

It is hard to imagine our life without questions. They facilitate orientation in our environment, enable interpersonal communication and make the acquisition of knowledge possible. Questions direct scientific research, are used as research tools and are an important medium of transferring knowledge in teaching. The book is intended as a par excellence philosophical monograph of the theory of questions, presenting the most important erotetic problems, their general background and selected practical applications. It is prepared in all fairness to results acquired (...) in the framework of the logical theories of questions but goes beyond this framework. (shrink)

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)

Uses erotetic logic to model the courtroom objection "Asked and Answered!".

This paper develops a new proof method for two propositional paraconsistent logics: the propositional part of Batens' weak paraconsistent logic CLuN and Schütte's maximally paraconsistent logic Φv. Proofs are de.ned as certain sequences of questions. The method is grounded in Inferential Erotetic Logic.

Our aim is to express in exact terms the old idea of solving problems by pure questioning. We consider the problem of derivability: "Is A derivable from Δ by classical propositional logic?". We develop a calculus of questions E*; a proof (called a Socratic proof) is a sequence of questions ending with a question whose affirmative answer is, in a sense, evident. The calculus is sound and complete with respect to classical propositional logic. A Socratic proof in E* can be (...) transformed into a Gentzen-style proof in some sequent calculi. Next we develop a calculus of questions E**; Socratic proofs in E** can be transformed into analytic tableaux. We show that Socratic proofs can be grounded in Inferential Erotetic Logic. After a slight modification, the analyzed systems can also be viewed as hypersequent calculi. (shrink)

Contents: Matti SINTONEN: From the Science of Logic to the Logic of Science. I: HISTORICAL PERSPECTIVES. Zev BECHLER: Hintikka on Plenitude in Aristotle. Marja-Liisa KAKKURI-KNUUTTILA: What Can the Sciences of Man Learn from Aristotle? Martin KUSCH: Theories of Questions in German-Speaking Philosophy Around the Turn of the Century. Nils-Eric SAHLIN: 'HE IS NO GOOD FOR MY WORK': On the Philosophical Relations between Ramsey and Wittgenstein. II: FORMAL TOOLS: INDUCTION, OBSERVATION AND IDENTIFIABILITY. Theo A.F. KUIPERS: The Carnap-Hintikka Programme in Inductive Logic. (...) Isaac LEVI: Caution and Nonmonotonic Inference. Ilkka NIINILUOTO: Inductive Logic, Atomism, and Observational Error. Arto MUTANEN: Theory of Identifiability. III: QUESTIONS IN INQUIRY: THE INTERROGATIVE MODEL. Sylvain BROMBERGER: Natural Kinds and Questions. Scott A. KLEINER: The Structure of Inquiry in Developmental Biology. Andrzej WISNIEWSKI: Some Foundational Concepts of Erotetic Semantics. Jan WOLE??N??SKI: Science and Games. IV: GROWTH OF KNOWLEDGE: EXPLANATION AND DISCOVERY. Matti SINTONEN: Explanation: The Fifth Decade. Erik WEBER: Scientific Explanation and the Interrogative Model of Inquiry. George GEBHARD: Scientific Discovery, Induction, and the Multi-Level Character of Scientific Inquiry. Mika KIIKERI: On the Logical Structure of Learning Models. V: JAAKKO HINTIKKA: REPLIES. VI: ABSTRACTS. (shrink)

This paper argues for the idea that the logic of questions should focus its attention on the analysis of arguments in which questions play the role of conclusions. The relevant concepts of validity are discussed and the concept of the logic of questions of a semantically interpreted formalized language is introduced.

In earlier publications of the first author it was shown that intentional explanation of actions, functional explanation of biological traits and causal explanation of abnormal events share a common structure. They are called explanation by specification (of a goal, a biological function, an abnormal causal factor, respectively) as opposed to explanation by subsumption under a law. Explanation by specification is guided by a schematic train of thought, of which the argumentative steps not concerning questions were already shown to be logically (...) valid (elementary) arguments.Independently, the second author developed a new, inferential approach to erotetic logic, the logic of questions. In this approach arguments resulting in questions, with declarative sentences and/or other questions as premises, are analyzed, and validity of such arguments is defined. (shrink)

The concepta question is reducible to a non-empty set of questions is defined and examined. The basic results are: (1) each question which is sound relative to some of its presuppositions is reducible to some set of binary (i.e. having exactly two direct answers) questions; (b) each question which has a finite number of direct answers is reducible to some finite set of binary questions; (c) if entailment is compact, then each normal question (i.e. sound relative to its presuppositions) is (...) reducible to some finite set of binary questions. (shrink)

Three semantic relations are analyzed: the relation of implication of a question by a question and a set of declarative sentences, the relation of implication of a question by a question, and the relation of strong implication of a question by a question and a set of declarative sentences. The connections between these concepts and the concepts of relative soundness, partial answerhood and presupposition are examined. The principal results are theorems about, to speak generally, epistemic reducibility of well-posed questions to (...) sequences of implied yes-no questions. (shrink)

The concept of erotetic argument is introduced. Two relations between sets of declarative sentences and questions are analysed; and two classes of erotetic arguments are characterized.

Ausgehend von der Einführung elementarer Aufforderungen über die pragmatische Begründung von Logikkalkülen bis hin zu einer vollständig durchgeführten Logik von Frage und Antwort stellt dieses Buch einen umfassenden Entwurf einer möglichen Grammatik wissenschaftlicher Orthosprachen vor. Besonderes Gewicht erhält in diesem Zusammenhang die Logik von Frage und Antwort. Dem für alle Wissenschaften existentiell relevanten Bereich der exakten Formulierung und Lösung von Problemstellungen wird durch die Bereitstellung von fragelogischen Kalkülen sowie einer logischen Problemlösungsheuristik Rechnung getragen.