Skip to main content

Part of the book series: Synthese Library ((SYLI,volume 164))

Abstract

What is nowadays the central part of any introduction to logic, and indeed to some the logical theory par excellence, used to be a modest fragment of the more ambitious language employed in the logicist program of Frege and Russell. ‘Elementary’ or ‘first-order’, or ‘predicate logic’ only became a recognized stable base for logical theory by 1930, when its interesting and fruitful meta-properties had become clear, such as completeness, compactness and Löwenheim-Skolem. Richer higher-order and type theories receded into the background, to such an extent that the (re-)discovery of useful and interesting extensions and variations upon first-order logic came as a surprise to many logicians in the sixties.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ackermann, W.: 1968, Solvable Cases of the Decision Problem, North-Holland, Amsterdam.

    Google Scholar 

  • Ajtai, M.: 1979, ‘Isomorphism and higher-order equivalence’, Annals of Math. Logic 16, 181–203.

    Article  Google Scholar 

  • Barendregt, H.: 1980, The Lambda Calculus, North-Holland, Amsterdam.

    Google Scholar 

  • Barwise, K. J.: 1972, ‘The Hanf-number of second-order logic’. J. Symbolic Logic 37, 588–594.

    Article  Google Scholar 

  • Barwise, K. J.: 1975, Admissible Sets and Structures, Springer, Berlin.

    Google Scholar 

  • Barwise, K. J. (ed.): 1977, Handbook of Mathematical Logic, North-Holland, Amsterdam.

    Google Scholar 

  • Barwise, K. J.: 1979, ‘On branching quantifiers in English’, J. Philos. Logic 8, 47–80.

    Article  Google Scholar 

  • Barwise, K. J. and Cooper, R.: 1981, ‘Generalized quantifiers and natural language’, Linguistics and Philosophy 4, 159–219.

    Article  Google Scholar 

  • Barwise, K.J. and Schlipf, J.: 1976, ‘An introduction to recursively saturated and resplendent models’, J. Symbolic Logic 41, 531–536.

    Article  Google Scholar 

  • Barwise, K. J., Kaufman, M. and Makkai, M.: 1978, ‘Stationary logic’, Annals of Math. Logic 13, 171–224. A correction appeared in Annals of Math. Logic 16, 231–232.

    Article  Google Scholar 

  • Bell, J. L. and Slomson, A. B.: 1969, Models and Ultraproducts, North-Holland, Amsterdam.

    Google Scholar 

  • Chang, C. C. and Keisler, H. J.: 1973, Model Theory, North-Holland, Amsterdam.

    Google Scholar 

  • Church, A.: 1940, ‘A formulation of the simple theory of types’, J. Symbolic Logic 5, 56–68.

    Article  Google Scholar 

  • Copi, I. M.: 1971, The Logical Theory of Types, Routledge & Kegan Paul, London.

    Google Scholar 

  • Drake, F. R.: 1974, Set Theory. An Introduction to Large Cardinals, North-Holland, Amsterdam.

    Google Scholar 

  • Enderton, H. B.: 1970, ‘Finite partially-ordered quantifiers’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 16, 393–397.

    Article  Google Scholar 

  • Enderton, H. B.: 1972, A Mathematical Introduction to Logic, Academic Press, New York.

    Google Scholar 

  • Gallin, D.: 1975, Intensional and Higher-Order Modal Logic, North-Holland, Amsterdam.

    Google Scholar 

  • Garland, S. J.: 1974, ‘Second-order cardinal characterizability’, in Proceedings of Symposia in Pure Mathematics, A.M.S., vol. 13, part II, 127–146.

    Google Scholar 

  • Henkin, L. A.: 1950, ‘Completeness in the theory of types’, J. Symbolic Logic 15, 81–91.

    Article  Google Scholar 

  • Henkin, L. A.: 1961, ‘Some remarks on infinitely long formulas’, in Infinitistic Methods. Proceedings of a Symposium on the Foundations of Mathematics, Pergamon Press, London, pp. 167–183.

    Google Scholar 

  • Henkin, L. A.: 1963, ‘A theory of propositional types’, Fundamenta Math. 52, 323–344.

    Google Scholar 

  • Hintikka, K. J. J.: 1955, ‘Reductions in the theory of types’, Acta Philosophica Fennica 8, 61–115.

    Google Scholar 

  • Hintikka, K. J. J.: 1973, ‘Quantifiers versus quantification theory’, Dialectica 27, 329–358.

    Article  Google Scholar 

  • Hodges, W.: 1983, Elementary predicate logic, Chapter I.1, this Handbook.

    Google Scholar 

  • Keisler, H. J.: 1971, Model Theory for Infinitary Logic, North-Holland, Amsterdam.

    Google Scholar 

  • Kemeny, J.: 1950, ‘Type theory vs. set theory’, J. Symbolic Logic 15, 78.

    Google Scholar 

  • Kleene, S. C.: 1952, ‘Finite axiomatizability of theories in the predicate calculus using additional predicate symbols’, in Two Papers on the Predicate Calculus, Memoirs of the Amer. Math. Soc. vol. 10, pp. 27–68.

    Google Scholar 

  • Kunen, K.: 1971, ‘Indescribability and the continuum’, in Proceedings of Symposia in Pure Mathematics, A.M.S., vol. 13, part I, 199–204.

    Google Scholar 

  • Lindström, P.: 1969, ‘On extensions of elementary logic’, Theoria 35, 1–11.

    Article  Google Scholar 

  • Magidor, M.: 1971, ‘On the role of supercompact and extendible cardinals in logic’, Israel J. Math. 10, 147–157.

    Article  Google Scholar 

  • Magidor, M. and Malitz, J.: 1977, ‘Compact extensions of LQ’, Annals of Math. Logic 11, 217–261.

    Article  Google Scholar 

  • Monk, J. D.: 1976, Mathematical Logic, Springer, Berlin.

    Google Scholar 

  • Montague, R.: 1974, in R. H. Thomason (ed.), Formal Philosophy: Selected Papers of Richard Montague, Yale University Press, New Haven.

    Google Scholar 

  • Moschovakis, Y. N.: 1980, Descriptive Set Theory, North-Holland, Amsterdam.

    Google Scholar 

  • Myhill, J. and Scott, D. S.: 1971, ‘Ordinal definability’, in Proceedings in Symposia in Pure Mathematics, A.M.S., vol. 13, part I, 271–278.

    Google Scholar 

  • Orey, S.: 1959, ‘Model theory for the higher-order predicate calculus’, Transactions of the American Mathematical Society 92, 72–84.

    Article  Google Scholar 

  • Rabin, M. O.: 1969, ‘Decidability of second-order theories and automata on infinite trees’, Transactions of the American Mathematical Society 141, 1–35.

    Google Scholar 

  • Ressayre, J. P.: 1977, ‘Models with compactness properties relative to an admissible language’, Annals of Math. Logic 11, 31–55.

    Article  Google Scholar 

  • Svenonius, L.: 1965, ‘On the denumerable models of theories with extra predicates’, in The Theory of Models, North-Holland, Amsterdam, pp. 376–389.

    Google Scholar 

  • Väänänen, J.: 1982, ‘Abstract logic and set theory: II Large cardinals’, J. Symbolic Logic 47, 335–346.

    Article  Google Scholar 

  • Van Benthem, J. F. A. K.: 1977, ‘Modal logic as second-order logic’, report 77-04, Mathematisch Instituut, University of Amsterdam.

    Google Scholar 

  • Van Benthem, J. F. A. K.: 1982, Questions about Quantifiers, to appear in J. Symbolic Logic.

    Google Scholar 

  • Van Benthem, J. F. A. K.: 1983, Modal Logic and Classical Logic, Bibliopolis, Naples.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 D. Reidel Publishing Company

About this chapter

Cite this chapter

Van Benthem, J., Doets, K. (1983). Higher-Order Logic. In: Gabbay, D., Guenthner, F. (eds) Handbook of Philosophical Logic. Synthese Library, vol 164. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7066-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-7066-3_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-7068-7

  • Online ISBN: 978-94-009-7066-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics