Results 1 
6 of
6
A ModelTheoretic Approach to Ordinal Analysis
 Bulletin of Symbolic Logic
, 1997
"... . We describe a modeltheoretic approach to ordinal analysis via the finite combinatorial notion of an #large set of natural numbers. In contrast to syntactic approaches that use cut elimination, this approach involves constructing finite sets of numbers with combinatorial properties that, in no ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
. We describe a modeltheoretic approach to ordinal analysis via the finite combinatorial notion of an #large set of natural numbers. In contrast to syntactic approaches that use cut elimination, this approach involves constructing finite sets of numbers with combinatorial properties that, in nonstandard instances, give rise to models of the theory being analyzed. This method is applied to obtain ordinal analyses of a number of interesting subsystems of first and secondorder arithmetic. x1. Introduction. Two of proof theory's defining goals are the justification of classical theories on constructive grounds, and the extraction of constructive information from classical proofs. Since Gentzen, ordinal analysis has been a major component in these pursuits, and the assignment of recursive ordinals to theories has proven to be an illuminating way of measuring their constructive strength. The traditional approach to ordinal analysis, which uses cutelimination procedures to transfor...
The modeltheoretic ordinal analysis of theories of predicative strength
 Journal of Symbolic Logic
, 1999
"... We use modeltheoretic methods described in [3] to obtain ordinal analyses of a number of theories of first and secondorder arithmetic, whose prooftheoretic ordinals are less than or equal to Γ0. 1 ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We use modeltheoretic methods described in [3] to obtain ordinal analyses of a number of theories of first and secondorder arithmetic, whose prooftheoretic ordinals are less than or equal to Γ0. 1
Finite Models of Elementary Recursive Nonstandard Analysis
, 1996
"... This paper provides a new proof of the consistency of a formal system similar to the one presented by Chuaqui and Suppes in [2, 9]. First, a simpler, yet in some respects stronger, system, called Elementary Recursive Nonstandard Analysis (ERNA) will be provided. Indeed, it will be shown that ERN ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper provides a new proof of the consistency of a formal system similar to the one presented by Chuaqui and Suppes in [2, 9]. First, a simpler, yet in some respects stronger, system, called Elementary Recursive Nonstandard Analysis (ERNA) will be provided. Indeed, it will be shown that ERNA proves the main axioms of the Chuaqui and Suppes system. Then a finitary consistency proof of ERNA will be given; in particular, we will show that PRA, the system of primitive recursive arithmetic, which is generally recognized as capturing Hilbert's notion of finitary, proves the consistency of ERNA. From the consistency proof we can extract a constructive method for obtaining finite approximations of models of nonstandard analysis. We present an isomorphism theorem for models that are finite substructures of infinite models. 1 Introduction This paper continues and extends the development of a constructive system of nonstandard analysis begun by Chuaqui and Suppes in [2, 9]. The ...
Prooftheoretic analysis by iterated reflection
 Arch. Math. Logic
"... Progressions of iterated reflection principles can be used as a tool for ordinal analysis of formal systems. Technically, in some sense, they replace the use of omegarule. We compare the information obtained by this kind of analysis with the results obtained by the more usual prooftheoretic techni ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Progressions of iterated reflection principles can be used as a tool for ordinal analysis of formal systems. Technically, in some sense, they replace the use of omegarule. We compare the information obtained by this kind of analysis with the results obtained by the more usual prooftheoretic techniques. In some cases the techniques of iterated reflection principles allows to obtain sharper results, e.g., to define prooftheoretic ordinals relevant to logical complexity Π 0 1. We provide a more general version of the fine structure formulas for iterated reflection principles (due to U. Schmerl [24]). This allows us, in a uniform manner, to analyze main fragments of arithmetic axiomatized by restricted forms of induction, including IΣn, IΣ − n, IΠ − n and their combinations. We also obtain new conservation results relating the hierarchies of uniform and local reflection principles. In particular, we show that (for a sufficiently broad class of theories T) the uniform Σ1reflection principle for T is Σ2conservative over the corresponding local reflection principle. This bears some corollaries on the hierarchies of restricted induction schemata in arithmetic and provides a key tool for our generalization of Schmerl’s theorem. 1
Brief introduction to unprovability
"... Abstract The article starts with a brief survey of Unprovability Theory as of autumn 2006. Then, as an illustration of the subject's modeltheoretic methods, we reprove exact versions of unprovability results for the ParisHarrington Principle and the KanamoriMcAloon Principle using indiscernibles. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract The article starts with a brief survey of Unprovability Theory as of autumn 2006. Then, as an illustration of the subject's modeltheoretic methods, we reprove exact versions of unprovability results for the ParisHarrington Principle and the KanamoriMcAloon Principle using indiscernibles. In addition, we obtain a short accessible proof of unprovability of the ParisHarrington Principle. The proof employs old ideas but uses only one colouring and directly extracts the set of indiscernibles from its homogeneous set. We also present modified, abridged statements whose unprovability proofs are especially simple. These proofs were tailored for teaching purposes. The article is intended to be accessible to the widest possible audience of mathematicians, philosophers and computer scientists as a brief survey of the subject, a guide through the literature in the field, an introduction to its modeltheoretic techniques and, finally, a modeltheoretic proof of a modern theorem in the subject. However, some understanding of logic is assumed on the part of the readers. The intended audience of this paper consists of logicians, logicaware mathematicians andthinkers of other backgrounds who are interested in unprovable mathematical statements.