Second-Order Logic and Foundations of Mathematics

  title={Second-Order Logic and Foundations of Mathematics},
  author={Jouko A. V{\"a}{\"a}n{\"a}nen},
  journal={Bulletin of Symbolic Logic},
  pages={504 - 520}
  • J. Väänänen
  • Published 1 December 2001
  • Philosophy
  • Bulletin of Symbolic Logic
Abstract We discuss the differences between first-order set theory and second-order logic as a foundation for mathematics. We analyse these languages in terms of two levels of formalization. The analysis shows that if second-order logic is understood in its full semantics capable of characterizing categorically central mathematical concepts, it relies entirely on informal reasoning. On the other hand, if it is given a weak semantics, it loses its power in expressing concepts categorically… 

Second‐Order Logic and Set Theory

This paper argues that it should be thought of first-order set theory as a very high-order logic, and compares the two approaches to second- order logic, evaluating their merits and weaknesses.

Second Order Logic, Set Theory and Foundations of Mathematics

The question, whether second order Logic is a better foundation for mathematics than set theory, is addressed and it is argued that the often stated difference, that second order logic has categorical characterizations of relevant mathematical structures, while set theory has non-standard models, amounts to no difference.

Higher-order Logic Reconsidered

  • I. Jané
  • Philosophy
    The Oxford Handbook of Philosophy of Mathematics and Logic
  • 2007
This paper two arguments are given against the suitability of using second-order consequence as the consequence relation of axiomatic theories, and it is argued that, unless it is viewed as an applied branch of set theory, its justified use requires embracing some strong form of philosophical realism.

A parametrised axiomatization for a large number of restricted second-order logics

A BSTRACT . By limiting the range of the predicate variables in a second-order language one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset

On Second Order Logic

I defend here the view that (full) second order logic, if considered as a foundation of mathematics, is best understood as a fragment of set theory. This view is very common among set theorists, and

Categoricity and Consistency in Second-Order Logic

It is argued that categorical characterisation of mathematical structures in second-order logic is meaningful and possible without assuming that the semantics of second- order logic is defined in set theory.

Strong logics of first and second order

This paper investigates the hierarchies of strong logics of first and second order that are generically invariant and faithful against the backdrop of the strongest large cardinal hypotheses and characterize the strongest logic in each hierarchy.

On Representations of Intended Structures in Foundational Theories

This paper examines how faithfully foundational theories can represent intended structures, and argues that this sheds light on the trade-off between expressive power and meta-theoretic properties when comparing first-order and second-order logic.

Axiomatizations of arithmetic and the first-order/second-order divide

It is argued that the first-order versus second-order divide may be too crude to investigate what an adequate axiomatization of arithmetic should look like, and that, insofar as there are different, equally legitimate projects one may engage in when working on the foundations of mathematics, there is no such thing as the One True Logic.

Second-order logic : ontological and epistemological problems

In this thesis I provide a survey over different approaches to second-order logic and its interpretation, and introduce a novel approach. Of special interest are the questions whether (a particular



Foundations without Foundationalism: A Case for Second-Order Logic

PART I: ORIENTATION Terms and questions Foundationalism and foundations of mathematics PART II: LOGIC AND MATHEMATICS Theory Metatheory Second-order logic and mathematics Advanced metatheory PART

Completeness in the Theory of Types

This proof demonstrates that each formula of the calculus is a formal theorem which becomes a true sentence under every one of a certain intended class of interpretations of the formal system.

The principles of mathematics revisited

1. The functions of logic and the problem of truth definition 2. The game of logic 3. Frege's fallacy foiled: Independence-friendly logic 4. The joys of independence: Some uses of IF logic 5. The

Subsystems of second order arithmetic

The results show clear trends in the development of mathematics within Subsystems of Z2 and in particular in the areas of arithmetical comprehension and models of Sub system design.

A Decision Method For Elementary Algebra And Geometry

By a decision method for a class K of sentence (or other expressions) is meant a method by means of which, given any sentence θ, one can always decide in a finite number of steps whether θ is in K;

The spectrum problem II: Totally transcendental and infinite depth

We examine the main gap for the class of models of totally transcendental first-order theories, and compute the number of ℵɛ-saturated models of power ℵɛ of a superstableT without the dop which is