Skip to main content
Log in

Language in action

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

Conclusions

A number of general points behind the story of this paper may be worth setting out separately, now that we have come to the end.

There is perhaps one obvious omission to be addressed right away. Although the word “information” has occurred throughout this paper, it must have struck the reader that we have had nothing to say on what information is. In this respect, our theories may be like those in physics: which do not explain what “energy” is (a notion which seems quite similar to “information” in several ways), but only give some basic laws about its behaviour and transmission.

The eventual recommendation made here has been to use a broad type-theoretic framework for studying various more classical and more dynamic notions of proposition in their interaction. This is not quite the viewpoint advocated by many current authors in the area, who argue for a whole-sale switch from a ‘static’ to a ‘dynamic’ perspective on propositions. This is not the place, however, to survey the conceptual arguments for and against such a more radical move.

This still leaves many questions about possible reductions from one perspective to another. For instance, it would seem that classical systems ought to serve as a ‘limiting case’, which should still be valid after procedural details of some cognitive process have been forgotten. There are various ways of implementing the desired correspondence: e.g. by considering extreme cases with ⫅ equal to identity, or, in the pure relational algebra framework by considering only pairs (x, x). What we shall want then are reductions of dynamic logics, in those special cases, to classical logic. But perhaps also, more sophisticated views are possible. How do we take a piece of ‘dynamic’ prose, remove control instructions and the like, and obtain a piece of ‘classical’ text, suitable for inference ‘in the light of eternity’?

There is also a more technical side to the matter of ‘reduction’. By now, Logic has reached such a state of ‘inter-translatability’ that almost all known variant logics can be embedded into each other, via suitable translations. In particular, once an adequate semantic has been given for a new system, this usually induces an embedding into standard logic: as we know, e.g., for the case of Modal Logic. Like-wise, all systems of dynamic interpretation or inference proposed so far admit of direct embedding into an ordinary ‘static’ predicate logic having explicit transition predicates (cf. van Benthem 1988b). Thus, our moral is this. The issue is not whether the new systems of information structure or processing are essentially beyond the expressive resources of traditional logical systems: for, they are not. The issue is rather which interesting phenomena and questions will be put into the right focus by them.

The next broad issue concerns the specific use of the perspective proposed here, vis-à-vis concrete proposals for information-oriented or dynamic semantics. The general strategy advocated here is to locate some suitable base calculus and then consider which ‘extras’ are peculiar to the proposal. For instance, this is the spirit in which modal S4 would be a base logic of information models, and intuitionistic logicthe special theory devoting itself to upward persistent propositions. Or, with the examples in Section 4.1, the underlying base logic is our relational algebra, whereas, say, ordinary updates then impose special properties, such as ‘idempotence’:

$$xRy \Rightarrow yRy$$

Does this kind of application presuppose the existence of one distinguished base logic, of which all others are extensions? This would be attractive-and some form of relational algebra or linear logic might be a reasonable candidate. Nevertheless, the enterprise does not rest on this outcome. What matters is an increased sensitivity to the ‘landscape’ of dynamic logics, just as with the ‘Categorial Hierarchy’ in Categorial Grammar (cf. van Benthem 1989a, 1991) where the family of logics with their interconnections seems more important than any specific patriarch.

Finally, perhaps the most important issue in the new framework is the possibility of new kinds of questions arising precisely because of its differences from standard logic. Notably, given the option of regarding propositions as programs, it will be of interest to consider systematically which major questions about programming languages now make sense inside logic too.

EXAMPLE. Correctness. When do we have

$$\left[\kern-0.15em\left[ \pi \right]\kern-0.15em\right](\left[\kern-0.15em\left[ A \right]\kern-0.15em\right]) \subseteq \left[\kern-0.15em\left[ B \right]\kern-0.15em\right]$$

for (s, t) propositions A, B and a dynamic (s, (s, t)) proposition π?

Program Synthesis. Which dynamic proposition will take us from an information state satisfying A to one satisfying B? (This question needs refinement, lest there be trivial answers.)

Determinism. Which propositions as programs are deterministic, in the sense of defining single-valued functions from states to states?

Querying. What does it mean to ask for information in the present setting? (Again, individual types referring to e will be crucial here.)

This is not merely an agenda for wishful thinking. Within Logic, there are various ways of introducing such concerns into semantics, especially, using tools from Automata Theory. (See van Benthem 1989c for further discussion of such computational perspectives in ‘cognitive programming’.)

At least if one believes that ‘dynamics’ is of the essence in cognition (rather than a mere interfacing problem between the halls of eternal truth and the noisy streets of reality), the true test for the present enterprise is the development of a significant new research program not merely copying the questions of old.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Abrusci, V. M., 1988a, ‘Sequent Calculus for Intuitionistic Linear Propositional Logic’, report 1, Department of Philosophy of Science, University of Bari.

  • Abrusci, V. M., 1988b, ‘A Comparison between Lambek Syntactic Calculus and Intuitionistic Linear Propositional Logic’, report 2, Department of Philosophy of Science, University of Bari.

  • Avron, A., 1988, ‘The Semantics and Proof Theory of Linear Logic’, Theoretical Computer Science 57, 161–184.

    Google Scholar 

  • Barwise, J., 1987, ‘Noun Phrases, Generalized Quantifiers and Anaphora’, in P. Gardenfors, ed., 1987, 1–29.

  • Benthem, J.van, 1985. Modal Logic and Classical Logic. Bibliopolis, Napoli/The Humanities Press, Atlantic Heights.

    Google Scholar 

  • Benthem, J.van, 1986, Essays in Logical Semantics, D. Reidel, Dordrecht.

    Google Scholar 

  • Benthem, J. van, 1987, ‘Categorial Grammar and Type Theory’, report 87-07, Institute for Language, Logic and Information, University of Amsterdam. Also appeared in Journal of Philosophical Logic 19, 115–168.

  • Benthem, J. van, 1987*, ‘Polyadic Quantifiers’, report 87-04, Institute for Language, Logic and Information, University of Amsterdam. Also appeared in Linguistics and Philosophy 12, 437–464.

  • Benthem, J. van, 1988a, ‘The Lambek Calculus’, in R. Oehrle et al., eds., 1988, 35–68.

  • Benthem, J. van, 1988b, ‘Semantic Parallels in Natural Language and Computation’, report 88-06, Institute for Language, Logic and Information, University of Amsterdam. Also appeared in H.-D. Ebbinghaus et al., eds., 1989, 331–375.

  • Benthem, J. van, 1988c, ‘Logical Constants across Varying Types’, report LP-88-05, Institute for Language, Logic and Information, University of Amsterdam. Also appeared in Notre Dame Journal of Formal Logic 30, 315–342.

  • Benthem, J. van, 1989a, ‘The Fine-Structure of Categorial Semantics’, report LP-89-01, Institute for Language, Logic and Information, University of Amsterdam. (To appear in M. Rosner, ed., Lugano Workshop on Computational Linguistics and Formal Semantics, Cambridge University Press.)

  • Benthem, J. van, 1989b, ‘Relational Algebra from The Perspective of Modal Logic’, Institute of Language, Logic and Information, University of Amsterdam.

  • Benthem, J. van, 1989c, ‘Modal Logic as a Theory of Information’, to appear in J. Copeland, ed., Proceedings Prior Memorial Conference, Christchurch, New Zealand.

    Google Scholar 

  • Benthem, J.van, 1991, Language in Action: Categories, Lambdas and Dynamic Logic, North-Holland, Amsterdam (Studies in Logic).

    Google Scholar 

  • Buszkowski, W., 1982, Lambek's Categorial Grammars, dissertation, Institute of Mathematics, Adam Mickiewicz University, Poznan.

    Google Scholar 

  • Buszkowski, W., 1986, ‘Completeness Results for Lambek Syntactic Calculus’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 32, 13–28.

    Google Scholar 

  • Buszkowski, W., Marciszewski, W., and Benthem, J.van, eds., 1988, Categorial Grammar, John Benjamin, Amsterdam and Philadelphia.

    Google Scholar 

  • Dalla Chiara, M.-L., 1985, ‘Quantum Logic’, in Gabbay & Guenthner, eds., 1985, 427–469.

  • Došen, K., 1985, ‘A Completeness Theorem for the Lambek Calculus of Syntactic Categories’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 31, 235–281.

    Google Scholar 

  • Dunn, M., 1985, ‘Relevance Logic and Entailment’, in Gabbay & Guenthner, eds., 1985, 117–224.

  • Ebbinghaus, H.-D., et al., eds., 1989, Logic Colloquium, Granada 1987, North-Holland, Amsterdam, (Studies in Logic).

    Google Scholar 

  • Fitch, F. B., 1952, Symbolic Logic: an Introduction, New York.

  • Gabbay, D. and Guenthner, F., eds., 1984, Handbook of Philosophical Logic, vol. II (Extensions of Classical Logic), D. Reidel, Dordrecht.

    Google Scholar 

  • Gabbay, D. and Guenthner, F., eds., 1985, Handbook of Philosophical Logic, vol. III (Alternatives to Classical Logic), D. Reidel, Dordrecht.

    Google Scholar 

  • Gabbay, D., Hogger, C. and Robinson, J., eds., 1990, Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford.

    Google Scholar 

  • Gabbay, D., Pnueli, A., Shelah, S., and Stavi, Y., 1980, ‘On the Temporal Analysis of Fairness’, ACM Symposium on Principles of Programming Languages, 163–173.

  • Gärdenfors, P., ed., 1987, Generalized Quantifiers. Linguistic and Logical Approaches, D. Reidel, Dordrecht.

    Google Scholar 

  • Gärdenfors, P., 1988, Knowledge in Flux: Modelling the Dynamics of Epistemic States, Bradford Books/MIT Press, Cambridge (Mass.).

    Google Scholar 

  • Gärdenfors, P. and Makinson, D., 1988, ‘Revision of Knowledge Systems Using Epistemic Entrenchment’, in M. Vardi, ed., 1988, 83–95.

  • Gargov, G., Passy, S., and Tinchev, T., 1987, ‘Modal Environment for Boolean Speculations’, in D. Skordev, ed., 1987, 253–263.

  • Girard, J.-Y., 1987, ‘Linear Logic’, Theoretical Computer Science 50, 1–102.

    Google Scholar 

  • Groenendijk, J. and Stokhof, M., 1988, ‘Dynamic Predicate Logic’, Institute for Language, Logic and Information, University of Amsterdam. (To appear in Linguistics and Philosophy.)

  • Harel, D., 1984, ‘Dynamic Logic’, in Gabbay & Guenthner, eds, 1984, 497–604.

  • Heim, I., 1982, The Semantics of Definite and Indefinite Noun Phrases, dissertation, Department of Linguistics, University of Massachusetts, Amherst.

    Google Scholar 

  • Hopcroft, J. and Ullman, J., 1979, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading (Mass.).

    Google Scholar 

  • Immerman, N. and Kozen, D., 1987, ‘Definability with Bounded Number of Bound Variables’, Proceedings IEEE 1987, 236–244.

    Google Scholar 

  • Jónsson, B. and Tarski, A., 1951, ‘Boolean Algebra with Operators I’, American Journal of Mathematics 73, 891–939.

    Google Scholar 

  • Jónsson, B., 1984, ‘The Theory of Binary Relations’, Department of Mathematics, VanderBilt University, Nashville (Tenn.).

    Google Scholar 

  • Koymans, R., 1989, Specifying Message Passing and Time-Critical Systems with Temporal Logic, dissertation, Department of Computer Science, Technological University, Eindhoven.

    Google Scholar 

  • Lafont, Y., 1988, ‘The Linear Abstract Machine’, Theoretical Computer Science 59, 157–180.

    Google Scholar 

  • Lambek, J., 1958, ‘The Mathematics of Sentence Structure’, American Mathematical Monthly 65, 154–170.

    Google Scholar 

  • Maddux, R., 1983, ‘A Sequent Calculus for Relation Algebras’, Annals of Pure and Applied Logic 25, 73–101.

    Google Scholar 

  • Makinson, D., 1988, ‘General Non-Monotonic Logic’, to appear in Gabbay et al., eds., 1990.

  • Moortgat, M., 1988, Categorial Investigations. Logical and Linguistic Aspects of the Lambek Calculus, Foris, Dordrecht (GRASS series).

    Google Scholar 

  • Oehrle, R., Bach, E., and Wheeler, D., eds. 1988. Categorial Grammars and Natural Language Structures, D. Reidel, Dordrecht (Studies in Linguistics and Philosophy).

    Google Scholar 

  • Ono, H., 1988, ‘Structural Rules and a Logical Hierarchy’, Faculty of Integrated Arts and Sciences, Hiroshima University.

  • Quine, W. V. O., 1946, ‘Concatenation as a Basis for Arithmetic’, Journal of Symbolic Logic 11, 105–114.

    Google Scholar 

  • Sambin, G., 1988, ‘Intuitionistic Formal Spaces and their Neighbourhood’, Mathematical Institute, University of Padova.

  • Skordev, D., ed., 1987, Mathematical Logic and its Applications, Plenum Press, New York.

    Google Scholar 

  • Troelstra, A. and Dalen, D.van, 1988, Constructivism in Mathematics: an Introduction. North-Holland, Amsterdam (Studies in Logic).

    Google Scholar 

  • Urquhart, A., 1972, ‘Semantics for Relevant Logics’, Journal of Symbolic Logic 37, 159–169.

    Google Scholar 

  • Vardi, M., ed., 1988, Proceedings 2d Conference on Theoretical Aspects of Reasoning about Knowledge, Morgan Kaufmann Publishers, Los Altos.

    Google Scholar 

  • Veltman, F., 1989, ‘Update Semantics’. Institute for Language, Logic and Information, University of Amsterdam.

  • Wansing, H., 1989, ‘The Adequacy Problem for Sequential Propositional Logic’, Institute for Language, Logic and Information, University of Amsterdam.

  • Zucker, J. and Tragesser, R., 1978, ‘The Adequacy Problem for Inferential Logic’, Journal of Philosophical Logic 7, 501–516.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Van Benthem, J. Language in action. J Philos Logic 20, 225–263 (1991). https://doi.org/10.1007/BF00250539

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00250539

Keywords

Navigation