|previous article in this issue|
Document Details :
Title: Decidability and Notation
Author(s): LAMPERT, Timm
Journal: Logique et Analyse
Volume: 251 Date: 2020
This paper first defines the concept of an iconic notation for a property P by a notation providing decision criteria for P. This definition distinguishes an iconic notation from a symbolic notation. The notion of an iconic proof is then defined by an algorithmic translation of a symbolic notation into an iconic notation. The defined concepts are illustrated by examples from mathematics and monadic logic. The definitions and examples then serve as a background for a discussion of the decision problem that asks for the possibility of an algorithmic translation of first-order formulas into a proper iconic notation for the whole realm of first-order logic.