scholarly journals The model-theoretic ordinal analysis of theories of predicative strength

1999 ◽  
Vol 64 (1) ◽  
pp. 327-349 ◽  
Author(s):  
Jeremy Avigad ◽  
Richard Sommer
Keyword(s):  
Second Order ◽  
Ordinal Analysis ◽  
Second Order Arithmetic ◽  
Order Arithmetic

AbstractWe use model-theoretic methods described in [3] to obtain ordinal analyses of a number of theories of first- and second-order arithmetic, whose proof-theoretic ordinals are less than or equal to Γ0.

A Model-Theoretic Approach to Ordinal Analysis

1997 ◽  
Vol 3 (1) ◽  
pp. 17-52 ◽  
Author(s):  
Jeremy Avigad ◽  
Richard Sommer
Keyword(s):  
Second Order ◽  
Cut Elimination ◽  
Large Set ◽  
Theoretic Approach ◽  
Natural Numbers ◽  
Finite Sets ◽  
Ordinal Analysis ◽  
Second Order Arithmetic ◽  
Combinatorial Properties ◽  
Order Arithmetic

AbstractWe describe a model-theoretic 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 second-order arithmetic.

scholarly journals Short note: Least fixed points versus least closed points

2021 ◽  
Author(s):  
Gerhard Jäger
Keyword(s):  
Fixed Points ◽  
Short Note ◽  
Second Order ◽  
Second Order Arithmetic ◽  
Order Arithmetic ◽  
Arithmetic Operator

AbstractThis short note is on the question whether the intersection of all fixed points of a positive arithmetic operator and the intersection of all its closed points can proved to be equivalent in a weak fragment of second order arithmetic.

UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES

2014 ◽  
Vol 79 (4) ◽  
pp. 1001-1019 ◽  
Author(s):  
ASHER M. KACH ◽  
ANTONIO MONTALBÁN
Keyword(s):  
Direct Product ◽  
Disjoint Union ◽  
Second Order ◽  
Linear Orders ◽  
Second Order Arithmetic ◽  
Order Arithmetic ◽  
Natural Classes ◽  
Product Of Groups

AbstractMany classes of structures have natural functions and relations on them: concatenation of linear orders, direct product of groups, disjoint union of equivalence structures, and so on. Here, we study the (un)decidability of the theory of several natural classes of structures with appropriate functions and relations. For some of these classes of structures, the resulting theory is decidable; for some of these classes of structures, the resulting theory is bi-interpretable with second-order arithmetic.

scholarly journals Periodic points and subsystems of second-order arithmetic

1993 ◽  
Vol 62 (1) ◽  
pp. 51-64 ◽  
Author(s):  
Harvey Friedman ◽  
Stephen G. Simpson ◽  
Xiaokang Yu
Keyword(s):  
Periodic Points ◽  
Second Order ◽  
Second Order Arithmetic ◽  
Order Arithmetic

Reverse Mathematics: The Playground of Logic

2010 ◽  
Vol 16 (3) ◽  
pp. 378-402 ◽  
Author(s):  
Richard A. Shore
Keyword(s):  
Mathematical Logic ◽  
Reverse Mathematics ◽  
Computational Approach ◽  
Second Order ◽  
Second Order Arithmetic ◽  
Base Theory ◽  
Order Arithmetic

AbstractThis paper is essentially the author's Gödel Lecture at the ASL Logic Colloquium '09 in Sofia extended and supplemented by material from some other papers. After a brief description of traditional reverse mathematics, a computational approach to is presented. There are then discussions of some interactions between reverse mathematics and the major branches of mathematical logic in terms of the techniques they supply as well as theorems for analysis. The emphasis here is on ones that lie outside the usual main systems of reverse mathematics. While retaining the usual base theory and working still within second order arithmetic, theorems are described that range from those far below the usual systems to ones far above.

Sign in / Sign up

Export Citation Format

Share Document