Project

Well partial ordenings in proof theory and maximal order types

Code
3F026611
Duration
01 October 2011 → 30 September 2015
Funding
Regional and community funding: Special Research Fund, Research Foundation - Flanders (FWO)
Research disciplines
  • Natural sciences
    • Analysis
    • Applied mathematics in specific fields
    • General mathematics
    • History and foundations
    • Other mathematical sciences
Keywords
proof-theoretic ordinal phase transitions well partial ordenings maximal order type
 
Project description

The most important code for a mathematical proof system from logic is the proof-theoretic ordinal. In many cases, this proof-theoretic ordinal can be calculated as the maximal order type of a well partial ordening (hereafter wpo). We will investigate wpo's of (non-ordered) trees, wpo's in mathematical practice (e.g. in reverse mathematics and proof theory) and phase transitions concering wpo's.