Sense and denotation as algorithm and value

In his classic 1892 paper On sense and denotation [12], Frege first contends that in addition to their denotation (reference, Bedeutung), proper names also have a sense (Sinn) “wherein the mode of presentation [of the denotation] is contained.” Here proper names include common nouns like “the earth” or “Odysseus” and descriptive phrases like “the point of intersection of lines L1 and L2” which are expected by their grammatical form to name some object. By the second fundamental doctrine introduced by Frege in the same paper, they also include declarative sentences: “[a simple, assertoric sentence is] to be regarded as a proper name, and its denotation, if it has one, is either the True or the False.” Thus every sentence denotes (or refers to) its truth value and expresses its sense, which is “a mode of presentation” of its truth value: this is all there is to the meaning of a sentence as far as logic is concerned. Finally, Frege claims that although sense and denotation are related (the first determines the second), they obey separate principles of compositionality, so that the truth value of a complex sentence φ is determined solely by the denotations of its constituent parts (terms and sentences), whatever the senses of these constituents parts may be. This is the basic principle which has made possible the development of sense-independent (two-valued, classical) denotational semantics for predicate logic, a variety of richer formal languages and (at least) fragments of natural language. Consider, for example, the arithmetical sentences

[1]  Alonzo Church,et al.  A Formulation of the Logic of Sense and Denotation , 1952 .

[2]  Keith S. Donnellan Reference and Definite Descriptions , 1966 .

[3]  Jean van Heijenoort Frege on sense identity , 1977, J. Philos. Log..

[4]  Y. Moschovakis Elementary induction on abstract structures (Studies in logic and the foundations of mathematics) , 1974 .

[5]  A. Church Outline of a Revised Formulation of the Logic of Sense and Denotation (Part II) , 1973 .

[6]  Peter G. Hinman,et al.  Generalized Recursion Theory , 1974 .

[7]  A. Turing On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[8]  László Dezsö,et al.  Universal Grammar , 1981, Certainty in Action.

[9]  A. Church Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem , 1937 .

[10]  Saul A. Kripke,et al.  Outline of a Theory of Truth , 1975 .

[11]  Yiannis N. Moschovakis,et al.  The formal language of recursion , 1989, Journal of Symbolic Logic.

[12]  Yiannis N. Moschovakis A Mathematical Modeling of Pure, Recursive Algorithms , 1989, Logic at Botik.

[13]  G. Sacks Higher recursion theory , 1990 .

[14]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[15]  G. Kreisel,et al.  Formally self-referential propositions for cut free classical analysis and related systems , 1974 .

[16]  Jean van Heijenoort Sense in Frege , 1977, J. Philos. Log..

[17]  J. Altham Naming and necessity. , 1981 .

[18]  Yiannis N. Moschovakis,et al.  Recursion in Higher Types , 1977 .

[19]  R. Platek Foundations of recursion theory , 1966 .

[20]  S. C. Kleene,et al.  Recursive functionals and quantifiers of finite types. II , 1959 .

[21]  David J. Israel,et al.  Structured Meanings: The Semantics of Propositional Attitudes. , 1987 .

[22]  K. Bach Varieties of Reference , 1994 .