# FOM: 16':Errata

Harvey Friedman friedman at math.ohio-state.edu
Mon Apr 20 05:28:01 EDT 1998

```This posting contains some corrections to the 16th posting in a series of
positive self contained postings to fom covering a wide range of topics in
f.o.m. Previous ones are:

1:Foundational Completeness   11/3/97, 10:13AM, 10:26AM.
2:Axioms  11/6/97.
3:Simplicity  11/14/97 10:10AM.
4:Simplicity  11/14/97  4:25PM
5:Constructions  11/15/97  5:24PM
6:Undefinability/Nonstandard Models   11/16/97  12:04AM
7.Undefinability/Nonstandard Models   11/17/97  12:31AM
8.Schemes 11/17/97    12:30AM
9:Nonstandard Arithmetic 11/18/97  11:53AM
10:Pathology   12/8/97   12:37AM
11:F.O.M. & Math Logic  12/14/97 5:47AM
12:Finite trees/large cardinals  3/11/98  11:36AM
13:Min recursion/Provably recursive functions  3/20/98  4:45AM
14:New characterizations of the provable ordinals  4/8/98  2:09AM
14':Errata  4/8/98  9:48AM
15:Structural Independence results and provable ordinals  4/16/98  10:53PM
16:Logical Equations, etc.  4/17/98  1:25PM

A complete archiving of fom, message by message, is available at
http://www.math.psu.edu/simpson/fom/
Also, my series of positive postings (only) is archived at
http://www.math.ohio-state.edu/foundations/manuscripts.html

1. R_<[E] = {y: there exists x < y such that R(x,y)}
should be
R_<[E] = {y: there exists x in E such that x < y and R(x,y)}.
This occurs twice in section 1.
2. We will consider only first order conditions on the automorphism.
should be
In this section, we will consider only first order conditions on the
automorphism.
This occurs in section 3.
3. Also, clearly, every such assertion is provably equivalent to a Pi^0_1
sentence.
should be
Also, every such assertion is provably equivalent to a Pi^0_1 sentence,
since it asserts the satisfiability of an appropriate set of sentences.
This occurs in section 3.
4. (A,<,R)*(x,y) if and only if min(R^x) < min(R^y).
should be
(A,<,R)*(x,y) if and only if min(R_x) < min(R_y).
This occurs in section 4.

```