Skip to main content Accessibility help
×
Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-30T16:50:51.122Z Has data issue: false hasContentIssue false

Logical constants: the variable fortunes of an elusive notion

from PART IV - PHILOSOPHY OF MODERN MATHEMATICAL AND LOGICAL THOUGHT

Published online by Cambridge University Press:  31 March 2017

Wilfried Sieg
Affiliation:
Carnegie Mellon University, Pennsylvania
Richard Sommer
Affiliation:
Stanford University, California
Carolyn Talcott
Affiliation:
Stanford University, California
Get access

Summary

Logic: inferential and expressive power Logic is usually taken to be the study of reasoning - and the highest rank of nobility for an assertion or an inference is ‘logical validity’. There are proof-theoretic methods for describing all validities for a given language, and completeness theorems assure us that we have found ‘all there is’ to a particular style of reasoning. But in addition to this inferential power, logic is also about expressive power. Reasoning needs a language supplying ‘logical forms’, and what determines the choice of these? Logical languages contain various forms of expression: propositional connectives, quantifiers, or modalities, whose meanings are analyzed in addition to their inferential behavior. But what makes these particular notions ‘logical’, as opposed to others? Perhaps the usual expressive completeness argument reassures us that the Boolean connectives capture all there is to two-valued propositional reasoning. But no similar result is known for first-order predicate logic, the major working system of modern logic.

This concern is not part of the basic ‘agenda’ in textbooks, partly because it is seldom raised, and partly because there is no consensus on an answer. Sol Feferman is one of the small group of authors who do think about this basic issue (cf. [9]), and I am happy to contribute a little piece of my own thinking on these matters. But before doing so, let me note that not all great logicianswould find the effort worthwhile. E.g., Bernard Bolzano's system, pioneering in so many ways, did not contain any privileged set of logical operations. For him, the distinction logical/non-logical is merely one of methodology. Forms of assertion for a style of reasoning arise by fixing the meanings of some expressions (these will have a ‘logic’ then), and letting others vary. But this distinction can go in more than one way. Granting this liberality, I still would like to find out what makes the usual ‘logical constants’ tick.

My aims in this are different from Feferman's excellent analysis, who mentions a ‘demarcation’ of logic as a major concern - and first-order logic as a preferred target. I myself feel no need for a principled separation of logic from other territories, mathematics, linguistics, computer science, psychology, or whatever.

Type
Chapter
Information
Reflections on the Foundations of Mathematics
Essays in Honor of Solomon Feferman
, pp. 420 - 440
Publisher: Cambridge University Press
Print publication year: 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] J., Barwise, Admissible Sets and Structures, Springer, Berlin, 1975.
[2] J., Barwise and J., van Benthem, Interpolation, Preservation, and Pebble Games, Journal of Symbolic Logic, vol. 64 (1999), no. 2, pp. 881-903.Google Scholar
[3] J., van Benthem, Essays in Logical Semantics, Reidel, Dordrecht, 1986.
[4] J., van Benthem, Logical Constants across Varying Types, Notre Dame Journal of Formal Logic, vol. 30 (1989), no. 3, pp. 315-342.Google Scholar
[5] J., van Benthem, Language in Action, North Holland, Amsterdam, 1991 (new edition with addenda, MIT Press, Boston 1995).
[6] J., van Benthem, Exploring Logical Dynamics, CSLI Publications, Stanford, 1996.
[7] J., van Benthem, Logic and Games, Technical report, (ILLC-X-2000-03) ILLC, University of Amsterdam, 2000.
[8] C., Butz and I., Moerdijk, An Elementary Definability Theorem for First-Order Logic, Journal of Symbolic Logic, vol. 64 (1999), no. 3, pp. 1028-1036.Google Scholar
[9] S., Feferman, Logic, Logics, Logicism, Notre Dame Journal of Formal Logic, vol. 40 (1999), special issue: George Boolos.Google Scholar
[10] T., Fernando, Bisimulations and Predicate Logic, Journal of Symbolic Logic, vol. 59 (1994), pp. 924-944.Google Scholar
[11] M., Stokhof, Dynamic Predicate Logic, Linguistics and Philosophy, vol. 14 (1991), pp. 39-100.Google Scholar
[12] I., Hacking, What is Logic?, Journal of Philosophy, vol. 76 (1979), pp. 285-319.Google Scholar
[13] J., Hintikka, Logic, Language, Games and Information, Clarendon, Oxford, 1973.
[14] E., Keenan and D., Westerstahl, Quantifiers, Handbook of Logic and Language (J., van Benthem and A., ter Meulen, editors), Elsevier, Amsterdam, 1997.
[15] A., Läuchli, An Abstract Notion of Realizability for which the Predicate Calculus is Complete, Intuitionism and Proof Theory (J., Myhill, A., Kino, and A., Vesley, editors), North-Holland, Amsterdam, 1970, pp. 227-234.
[16] McCarthy, T., The Idea of a Logical Constant, Journal of Philosophy, vol. 78 (1981), pp. 499- 523.Google Scholar
[17] V., McGee, Logical Operations, Journal of Philosophical Logic, vol. 25 (1996), pp. 567-580.Google Scholar
[18] G., Plotkin, Lambda Definability in the the Full Type Hierarchy, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J., Seldin and J., Hindley, editors), Academic Press, London, 1980, pp. 363-373.
[19] G., Sher, The Bounds of Logic, MIT Press, Cambridge Mass., 1991.
[20] R., Statman, Completeness, Invariance, and _-Definabilty, Journal of Symbolic Logic, vol. 47 (1982), pp. 17-26.Google Scholar
[21] A., Tarski,What are Logical Notions?, History and Philosophy of Logic, vol. 7 (1986), pp. 143- 154.Google Scholar
[22] B., Trakhtenbrot, On ‘Logical Relations’ in Program Semantics, Mathematical Logic and its Applications (D., Skordev, editor), Plenum Press, New York, 1987, pp. 213-229.
[23] H., Weyl, Philosophy of Mathematics and Natural Science, Atheneum, New York, 1963 (translated reprint from 1926).
[24] J., Zwarts, A Semantic Characterization of Locative Prepositional Phrases, Proceedings of Semantics and Linguistic Theory (SALT 97), 1997.Google Scholar
[25] E.C., Zeeman, Causality implies the Lorentz Group, Journal of Mathematical Physics, vol. 5 (1964), pp. 490-493.Google Scholar
[26] J., Zucker, The Adequacy Problem for Classical Logic, Journal of Philosophical Logic, vol. 7 (1978), pp. 517-535.Google Scholar
[27] R., Tragesser, The Adequacy Problem for Inferential Logic, Journal of Philosophical Logic, vol. 7 (1978), pp. 501-516.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×