Part of the ambiguity lies in the various points of view from which this question might be considered. The crudest di erence lies between the point of view of the working mathematician and that of the logician concerned with the foundations of mathematics. Now some of my fellow mathematical logicians might protest this distinction, since they consider themselves to be just more of those \working mathematicians". Certainly, modern logic has established itself as a very respectable branch of mathematics, and there (...) are quite a few highly technical journals in logic, such as The Journal of Sym-. (shrink)

Two countable well orderings are weakly comparable if there is an order preserving injection of one into the other. We say the well orderings are strongly comparable if the injection is an isomorphism between one ordering and an initial segment of the other. In [5], Friedman announced that the statement “any two countable well orderings are strongly comparable” is equivalent to ATR 0 . Simpson provides a detailed proof of this result in Chapter 5 of [13]. More recently, (...) class='Hi'>Friedman has proved that the statement “any two countable well orderings are weakly comparable” is equivalent to ATR 0 . The main goal of this paper is to give a detailed exposition of this result. (shrink)

Reflection, in the sense of [Fr03a] and [Fr03b], is based on the idea that a category of classes has a subclass that is “similar” to the category. Here we present axiomatizations based on the idea that a category of classes that does not form a class has extensionally different subclasses that are “similar”. We present two such similarity principles, which are shown to interpret and be interpretable in certain set theories with large cardinal axioms.

The use of x[y,z,w] rather than the more usual y Πx has many advantages for this work. One of them is that we have found a convenient way to eliminate any need for axiom schemes. All axioms considered are single sentences with clear meaning. (In one case only, the axiom is a conjunction of a manageable finite number of sentences).

This is the initial publication on Concept Calculus, which establishes mutual interpretability between formal systems based on informal commonsense concepts and formal systems for mathematics through abstract set theory. Here we work with axioms for "better than" and "much better than", and the Zermelo and Zermelo Frankel axioms for set theory.

Let k ≥ 2 and f:Nk Æ [1,k] and n ≥ 1 be such that there is no x1 < ... < xk+1 £ n such that f(x1,...,xk) = f(x1,...,xk+1). Then we want to find g:Nk+1 Æ [1,3] such that there is no x1 < ... < xk+2 £ n such that g(x1,...,xk+1) = g(x2,...,xk+2). This reducees adjacent Ramsey in k dimensions with k colors to adjacent Ramsey in k+1 dimensions with 3 colors.

The subtle, almost ineffable, and ineffable cardinals were introduced in an unpublished 1971 manuscript of R. Jensen and K. Kunen. The concepts were extended to that of k-subtle, k-almost ineffable, and k-ineffable cardinals in 1975 by J. Baumgartner. In this paper we give a self contained treatment of the basic facts about this level of the large cardinal hierarchy, which were established by J. Baumgartner. In particular, we give a proof that the k-subtle, k-almost ineffable, and k-ineffable cardinals define three (...) properly intertwined hierarchies with the same limit, lying strictly above “total indescribability” and strictly below “arrowing ω”. The innovation here is presented in Section 2, where we take a distinctly minimalist approach. Here the subtle cardinal hierarchy is characterized by very elementary properties that do not mention closed unbounded or stationary sets. This development culminates in a characterization of the hierarchy by means of a striking universal second-order property of linear orderings. (shrink)

Here we take the view that LPC(=) is applicable to structures whose domain is too large to be a set. This is not just a matter of class theory versus set theory, although it can be interpreted as such, and this interpretation is discussed briefly at the end.

We now fix A ⊆ Q. We study a fundamental class of digraphs associated with A, which we call the A-digraphs. An A,kdigraph is a digraph (Ak,E), where E is an order invariant subset of A2k in the following sense. For all x,y ∈ A2k, if x,y have the same order type then x ∈ E ↔ y ∈ E.

It has been accepted since the early part of the Century that there is no problem formalizing mathematics in standard formal systems of axiomatic set theory. Most people feel that they know as much as they ever want to know about how one can reduce natural numbers, integers, rationals, reals, and complex numbers to sets, and prove all of their basic properties. Furthermore, that this can continue through more and more complicated material, and that there is never a real problem.

The kind of unknowability I will discuss concerns the count of certain natural finite sets of objects. Even the situation with regard to our present strong formal systems is rather unclear. One can just profitably focus on that, putting aside issues of general unknowability.

Let R Õ [1,n]3k ¥ [1,n]k. We define R = {y Œ [1,n]k:($xŒA3)(R(x,y))}. We say that R is strictly dominating if and only if for all x,yŒ[1,n]k, if R(x,y) then max(x) < max(y).

We axiomatize EFA in strictly mathematical terms, involving only the ring operations, without extending the language by either exponentiation, finite sets of integers, or polynomials.

In mathematics, we back up our discoveries with rigorous deductive proofs. Mathematicians develop a keen instinctive sense of what makes a proof rigorous. In logic, we strive for a *theory* of rigorous proofs.

It turns out, time and time again, in order to make serious progress in f.o.m., we need to take actual reasoning and actual development into account at precisely the proper level. If we take these into account too much, then we are faced with information that is just too difficult to create an exact science around - at least at a given state of development of f.o.m. And if we take these into account too little, our findings will not have (...) the relevance to mathematical practice that could be achieved. (shrink)

We present several selection theorems for Borel relations, involving only Borel sets and functions, all of which can be obtained as consequences of closely related theorems proved in [DSR 96,99,01,01X] involving coanalytic sets. The relevant proofs given there use substantial set theoretic methods, which were also shown to be necessary. We show that none of our Borel consequences can be proved without substantial set theoretic methods. The results are established for Baire space. We give equivalents of some of the main (...) results for the reals. (shrink)

We have been recently engaged in this search, and have announced a long series of successively simpler and more convincing examples. See [Fr09-10].

We present two forms of “sentential reflection”, which are shown to be mutually interpretable with Z2 and ZFC, respectively.

A lot of the well known impact of the Gödel phenomena is in the form of painful messages telling us that certain major mathematical programs cannot be completed as intended. This aspect of Gödel – the delivery of bad news –is not welcomed, and defensive measures are now in place.

We begin by presenting the language L(N,℘N,℘℘N). This is the standard language for presenting third order sentences, using its intended interpretation.

1. Transfer principles from N to On. A. Mahlo cardinals. B. Weakly compact cardinals. C. Ineffable cardinals. D. Ramsey cardinals. E. Ineffably Ramsey cardinals. F. Subtle cardinals. G. From N to (...) 4. Decidability of statements on N. 5. Decidability of statements on shrink)

Russell’s way out of his paradox via the impredicative theory of types has roughly the same logical power as Zermelo set theory - which supplanted it as a far more flexible and workable axiomatic foundation for mathematics. We discuss some new formalisms that are conceptually close to Russell, yet simpler, and have the same logical power as higher set theory - as represented by the far more powerful Zermelo-Frankel set theory and beyond. END.

This is widely accepted, inside and outside philosophy, but one can spend an entire career clarifying, justifying, and amplifying on this statement. Certainly a graduate student career.

This topic has been discussed earlier on the FOM email list in various guises. The common theme is: big numbers and long sequences associated with mathematical objects. See..

Provide a formal system that is a conservative extension of PA for Π02 sentences, and even a conservative extension of HA, that supports the worry free smooth development of constructive analysis in the style of Errett Bishop.

BRT is always based on a choice of BRT setting. A BRT setting is a pair (V,K), where V is an interesting family of multivariate functions. K is an interesting family of sets. In this talk, we will only consider V,K, where V is an interesting family of multivariate functions from N into N. K is an interesting family of subsets of N.

We focus on two formal methods contexts which generate investigations into decision problems for finite strings.

The equation P = NP concerns algorithms for deciding membership in sets. The consensus is that P ≠ NP, although some prominent experts guess otherwise.

NOTE: This is an expanded version of my lecture at the special session on reverse mathematics, delivered at the Special Session on Reverse Mathematics held at the Atlanta AMS meeting, on January 6, 2005.

This distinction between logic and mathematics is subject to various criticisms and can be given various defenses. Nevertheless, the division seems natural enough and is commonly adopted in presentations of the standard foundations for mathematics.

We show the algorithmic unsolvability of a number of decision procedures in ordinary two dimensional Euclidean geometry, involving lines and integer points. We also consider formulations involving integral domains of characteristic 0, and ordered rings. The main tool is the solution to Hilbert's Tenth Problem. The limited number of facts used from recursion theory are isolated at the beginning.

Mathematical Logic had a glorious period in the 1930s, which was briefly rekindled in the 1960s. Any Shock Value, such as it is, has surrounded unprovability from ZFC.

An extreme kind of logic skeptic claims that "the present formal systems used for the foundations of mathematics are artificially strong, thereby causing unnecessary headaches such as the Gödel incompleteness phenomena". The skeptic continues by claiming that "logician's systems always contain overly general assertions, and/or assertions about overly general notions, that are not used in any significant way in normal mathematics. For example, induction for all statements, or even all statements of certain restricted forms, is far too general - mathematicians (...) only use induction for natural statements that actually arise. If logicians would tailor their formal systems to conform to the naturalness of normal mathematics, then various logical difficulties would disappear, and the story of the foundations of mathematics would look radically different than it does today. In particular, it should be possible to give a convincing model of actual mathematical practice that can be proved to be free of contradiction using methods that lie within what Hilbert had in mind in connection with his program”. Here we present some specific results in the direction of refuting this point of view, and introduce the Strict Reverse Mathematics (SRM) program. (shrink)

I don’t remember if I got as high as 2-390, but I distinctly remember taking my first logic course - as a Freshman - with Hartley Rogers, in Fall 1964 - here in 2-190. Or was it in 2-290?

In the Foundational Life, philosophy is commonly used as a method for choosing and analyzing fundamental concepts, and mathematics is commonly used for rigorous development. The mathematics informs the philosophy and the philosophy informs the mathematics.

Normal mathematical culture is overwhelmingly concerned with finite structures, finitely generated structures, discrete structures (countably infinite), continuous and piecewise continuous functions between complete separable metric spaces, with lesser consideration of pointwise limits of sequences of such functions, and Borel measurable functions between complete separable metric spaces.

C. To what extent, and in what sense, is the natural hierarchy of logical strengths rep resented by familiar systems ranging from exponential function arithmetic to ZF + j:V Æ V robust?

We focus on two formal methods contexts which generate investigations into decision problems for finite strings.

We say that R is strictly dominating if and only if for all x,yŒ[1,n], if R(x,y) then max(x) 3k ¥ [1,n], there exists A Õ [1,n] such that R = A. Furthermore, A Õ [1,n] is unique.

To prove this, we fix P(x) to be any polynomial of degree ≥ 1 with a positive and negative value. We define a critical interval to be any nonempty open interval on which P is strictly monotone and where P is not strictly monotone on any larger open interval. Here an open interval may not have endpoints in F, and may be infinite on the left or right or both sides. Obviously, the critical intervals are pairwise disjoint.

We present some new set and class theoretic independence results from ZFC and NBGC that are particularly simple and close to the primitives of membership and equality. They are shown to be equivalent to familiar small large cardinal hypotheses. We modify these independendent statements in order to give an example of a sentence in set theory with 5 quantifiers which is independent of ZFC. It is known that all 3 quantifier sentences are decided in a weak fragment of ZF without (...) power set. (shrink)

We characterize the o-minimal expansions of the ring of real numbers, in mathematically transparent terms. This should help bridge the gap between investigators in o-minimality and mathematicians unfamiliar with model theory, who are concerned with such notions as non oscillatory behavior, tame topology, and analyzable functions. We adapt the characterization to the case of o-minimal expansions of an arbitrary ordered ring.

• Wright Brothers made a two mile flight • Wright Brothers made a 42 mile flight • Want to ship goods • Want to move lots of passengers • Want reliability and safety • Want low cost • ... Modern aviation • Each major advance spawns reasonable demands for more and more • Excruciating difficulties overcome • Armies of people over decades or more • Same story for any practically any epoch breaking advance in anything..

Extrapolating from the work of Mahlo , one can prove that given any pair of countable closed totally bounded subsets of complete separable metric spaces, one subset can be homeomorphically embedded in the other. This sort of topological comparability is reminiscent of the statements concerning comparability of well orderings which Friedman has shown to be equivalent to ATR0 over the weak base system RCA0. The main result of this paper states that topological comparability is also equivalent to ATR0. In (...) Section 1, the pertinent subsystems of second-order arithmetic and results on well orderings are reviewed. Sections 2 and 3 overview the encoding of metric spaces and homeomorphisms in second-order arithmetic. Section 4 contains a proof of the topological comparability result in ATR0. Section 5 contains the reversal, a derivation of ATR0 from the topological comparability result. In Section 6, additional information about the structure of the embeddings is obtained, culminating in an application to closed subsets of the real numbers. (shrink)

Since then we have been engaged in the development of such results of greater relevance to mathematical practice. In January, 1997 we presented some new results of this kind involving what we call “jump free” classes of finite functions. This Jump Free Theorem is treated in section 2.

We consider intuitionistic number theory with recursive infinitary rules . Any primitive recursive binary relation for which transfinite induction schema is provable is in fact well founded. Its ordinal is less than ε 0 if the transfinite induction schema is intuitionistically provable in elementary number theory. These results are provable intuitionistically. In fact, it suffices to consider transfinite induction with respect to one particular number-theoretic property.