Skip to main content

On the Semantic Concept of Logical Consequence

  • Conference paper
  • First Online:
New Frontiers in Artificial Intelligence (JSAI-isAI 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12331))

Included in the following conference series:

  • 608 Accesses

Abstract

In this paper, we give a groundwork for the foundations of the semantic concept of logical consequence. We first give an opinionated survey of recent discussions on the model-theoretic concept, in particular Etchemendy’s criticisms and responses, alluding to Kreisel’s squeezing argument. We then present a view that in a sense the semantic concept of logical consequence irreducibly depends on the meaning of logical expressions but in another sense the extensional adequacy of the semantic account of first-order logical consequence is also of fundamental importance. We further point out a connection with proof-theoretic semantics.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    In the following we often switch the terms i) “l.c.” and ii) “logical truth or validity” as a special case. The difference never affects our philosophical points.

  2. 2.

    This is obviously condensed. For details, see, e.g., [6].

  3. 3.

    It may sound misleading to quote this sentence from [27], for the concept of “model” is in [27] is significantly different from the currently standard one since Tarski’s does not seem to allow domain variations. We handle the issue later.

  4. 4.

    Glanzberg [11] discusses the issue of what sort of “truth conditions” we consider in different schools of the semantics of natural language. According to him, Davidsonians consider the absolute notion of truth condition, Montagovians initially considered the one based on “truth in a model” but these days they also use the absolute notion.

  5. 5.

    The problem has been aware of, e.g., “Mathematics as a whole – this is the lesson of the set theoretic antinomies – is not a structure itself, i.e., an object of mathematical investigation, nor is it isomorphic to one ( [1], p. 7).”

  6. 6.

    Indeed, Etchemendy states, “it is hard to understand why in the semantics for first-order languages we vary the domain of quantification (p. 290, [8]).”

  7. 7.

    We do not go into historical issues here.

  8. 8.

    The second weakness can be fixed by avoiding equality and by using any relation symbol s.t. (*) that R is transitive and irreflexive implies that there exists x for all y s.t. \(\lnot R (x,y)\). The negation of (*) has only infinite models. But we keep using equality.

  9. 9.

    This is a kind of relativization, but we universally quantify over relativizations.

  10. 10.

    He adds that the issue of the choice of logical constants is red herring, for the dependence on extralogical facts can arise even when all expressions are “logical constants,” e.g., \(\forall x \forall y \forall P (Px \rightarrow Py)\). This is true in a world with essentially one object.

  11. 11.

    In [8], Etchemendy emphasizes that Kripke semantics is a good case of representational semantics. However, he elsewhere suggests that there is a severe limitation in representational semantics. “\(2 + 2 \ne 4\) (p. 62, [7])” is easy to make sense in interpretational semantics but makes no sense in representational one (since mathematical truth is a necessary truth). This can be a reason why interpretational semantics is also needed in addition to the representational view. See Sect. 3, Sect. 4.

  12. 12.

    Schurz [23] also claims that the intensions of logical terms are determined by the recursive truth definition.

  13. 13.

    He does not explain the phrase “the ordinary concept of logical truth,” either.

  14. 14.

    [12, 26], etc. analyze fallacies in his argument. We omit these partly because we have reason to reject his claim even if we find no alleged fallacy in the argument.

  15. 15.

    We omit the details of the complicated background of this notion of Val.

  16. 16.

    There are some other solutions, e.g. Boolos’ in [3] and McGee’s [17].

  17. 17.

    Shapiro takes modality involved in l.c. to be a “logical modality” given with respect to the isomorphism property (a necessary condition for a logical term). But Hanson’s modality is not particularly “logical.”

  18. 18.

    Due to the limited space, we often state our points without detailed arguments.

  19. 19.

    One might immediately object that \(=\) is not a logical symbol. However, such a change’s raising significant difference would already make dubious the robustness of the view. Also, from an intensional viewpoint, it is out of the question whether we can extensionally accommodate this pre-theoretic concept by a subsitutional account.

  20. 20.

    L.c. can be a special case of “analytic” consequence. A system of transformation rules which transforms an atomic formula to another can be taken to give an analytic consequence. Formal systems of logic are often conservative extensions thereof (cf. [21]).

  21. 21.

    We refrain from entirely agreeing with Etchemendy and Shapiro about the details.

  22. 22.

    Even this may not be entirely unproblematic. There is an issue called “non-categoricity” in propositional logic first pointed out by Carnap [4].

  23. 23.

    This point seems to be underrated (see [23]), although this is not unnoticed, e.g., Enderton’s textbook treats quantifiers as “parameters [24].”

  24. 24.

    Etchemendy addresses the issue (p. 275, footnote 6, [8]), saying that the finitist overgenerates. But there may be a further problem: the use of the axiom of infinity in proving completeness makes Etchemendy’s squeezing argument circular.

  25. 25.

    This roughly means that logical truth corresponds to a lack of counterexample.

  26. 26.

    Quine’s substitutional view in [20] is based on the Hilbert-Bernays arithemtiized completeness theorem. There is a subtlety on the issue of compactness. See [2, 6].

  27. 27.

    This issue is not simple, since those who argue that the infinity of a domain can be equipped on purely logical ground consider only first-order logic. To invalidate a formula in first-order language, we only need a countable model (see \(V^\omega \)). But things are more complicated in second-order logic, since falsifying a sentence in the language of second-order logic may require staggering ontology (p. 151, [24]). For second-order logic, Parsons’ entanglement view is more reasonable.

  28. 28.

    The concept is so fundamental that it may be difficult to reduce it to something more fundamental.

References

  1. Bernays, P.: Schematic korrespondenz und die idealisierten strukturen (English translation: schematic correspondence and idealized structures, bernays project). Dialectica, pp. 14–25 (1970). www.phil.cmu.edu/projects/bernays/

  2. Boolos, G.: On second-order logic. J. Philos. 72(16), 509–527 (1975)

    Article  Google Scholar 

  3. Boolos, G.: Nominalist platonism. Philos. Rev. 94(3), 327–344 (1985)

    Article  MathSciNet  Google Scholar 

  4. Carnap, R.: Formalization of Logic. H. U. Press, Cambridge (1943)

    MATH  Google Scholar 

  5. Chihara, C.: Tarski’s thesis and the ontology of mathematics. In: Schirn, M. (ed.) The Philosophy of Mathematics Today, pp. 157–172. Clarendon Press (1998)

    Google Scholar 

  6. Eder, G.: Boolos and the metamathematics of quine’s definitions of logical truth and consequence. Hist. Philos. Log. 37(2), 170–193 (2016)

    Article  MathSciNet  Google Scholar 

  7. Etchemendy, J.: The Concept of Logical Consequence. HUP (1990)

    Google Scholar 

  8. Etchemendy, J.: Reflections on consequence. In: Patterson, D. (ed.) New Essays on Tarski and Philosophy, pp. 263–299. Oxford University Press, Oxford (2008)

    Chapter  Google Scholar 

  9. Field, H.: What is logical validity? In: Caret, C.R., Hjortland, O.T. (eds.) Foundations of Logical Consequence. Oxford University Press, Oxford (2015)

    Google Scholar 

  10. García-Carpintero, S.: The grounds for the model-theoretic account of the logical properties. Notre Dame J. Form. Log. 34(1), 107–131 (1993)

    Article  MathSciNet  Google Scholar 

  11. Glanzberg, M.: Logical consequence and natural language. In: Caret, C., Hjortland, O. (ed.) Foundations of Logical Consequence, pp. 71–120. OUP (2015)

    Google Scholar 

  12. Gómez-Torrente, M.: Logical truth and Tarskian logical truth. Synthese 117(3), 375–408 (1998)

    Article  MathSciNet  Google Scholar 

  13. Hanson, W.H.: The concept of logical consequence. Philos. Rev. 106 (1997). https://doi.org/10.2307/2998398

  14. Kreisel, G.: Informal Rigour and completeness proofs. In: Lakatos, I. (ed.) Problems in the philosophy of mathematics. North Holland, Amsterdam (1967)

    Google Scholar 

  15. Kreisel, G.: What have we learnt from Hilbert’s second problem? In: Mathematical developments arising from Hilbert problems (Proceedings of Symposia in Pure Mathematics). AMS (1976)

    Google Scholar 

  16. MacFarlane, M.: What is modeled by truth in all models? (2000). Unpublished preprint presented at the 2000 Pacific Division APA

    Google Scholar 

  17. McGee, V.: Two problems with Tarski’s theory of consequence. Proc. Aristot. Soc. 92(1), 273–292 (1992)

    Article  Google Scholar 

  18. Parsons, C.: Some consequences of the entanglement of logic and mathematics. Ref. Rat. Phenomenol. 2, 153–178 (2013)

    Google Scholar 

  19. Prawitz, D.: Remarks on some approaches to the concept of logical consequence. Synthese 62, 153–171 (1985)

    Article  MathSciNet  Google Scholar 

  20. Quine, W.: Philosophy of Logic, 2nd edn. Harvard University Press, Cambridge (1986)

    Google Scholar 

  21. Read, S.: Formal and material consequence. J. Philos. Log. 23(3), 247–265 (1994)

    Article  MathSciNet  Google Scholar 

  22. Sambin, G., Battilotti, G., Faggian, C.: Basic logic: reflection, symmetry, visibility. J. Symb. Log. 65(3), 979–1013 (2000)

    Article  MathSciNet  Google Scholar 

  23. Schurz, G.: Tarski and Carnap on logical truth: or: what is genuine logic? Vienna Circ. Inst. Yearb. 6, 77–94 (1999)

    MathSciNet  MATH  Google Scholar 

  24. Shapiro, S.: Logical consequence: models and modality. In: Schirn, M. (ed.) The Philosophy of Mathematics Today, pp. 131–156. Clarendon Press (1998)

    Google Scholar 

  25. Shapiro, S.: Logical consequence, proof theory, and model theory. In: Oxford Handbook of Philosophy of Mathematics and Logic (2005)

    Google Scholar 

  26. Soames, S.: Understanding Truth. Oxford University Press, Oxford (1998)

    MATH  Google Scholar 

  27. Tarski, A.: On the concept of following logically translated by Magda Stroinska and David Hitchcock. Hist. Philos. Log. 23(3), 155–196 (2002)

    Article  Google Scholar 

  28. Zimmermann, T.: Model-theoretic semantics. In: Heusinger, K.v., C.M., Portner, P. (eds.) Handbook of Semantics, vol. 1, pp. 762–802. De Gruyter (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hidenori Kurokawa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kurokawa, H. (2020). On the Semantic Concept of Logical Consequence. In: Sakamoto, M., Okazaki, N., Mineshima, K., Satoh, K. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2019. Lecture Notes in Computer Science(), vol 12331. Springer, Cham. https://doi.org/10.1007/978-3-030-58790-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58790-1_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58789-5

  • Online ISBN: 978-3-030-58790-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics