Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T05:27:55.897Z Has data issue: false hasContentIssue false

CALCULIZING CLASSICAL INFERENTIAL EROTETIC LOGIC

Published online by Cambridge University Press:  29 June 2020

MORITZ CORDES*
Affiliation:
DEPARTMENT OF PHILOSOPHY UNIVERSITY OF GREIFSWALD GREIFSWALD, GERMANY E-mail: cordesm@uni-greifswald.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.”

Information

Type
Research Article
Copyright
© Association for Symbolic Logic, 2020