Proof theory. The first step into impredicativity

From MaRDI portal
Publication:930618

DOI10.1007/978-3-540-69319-2zbMath1153.03001OpenAlexW4239393213MaRDI QIDQ930618

Wolfram Pohlers

Publication date: 1 July 2008

Published in: Universitext (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69319-2




Related Items (54)

, , AND REINHARDT’S PROGRAMOn elementary theories of ordinal notation systems based on reflection principlesRelative Truth Definability of Axiomatic Truth TheoriesDe Finettian logics of indicative conditionals. II: Proof theory and algebraic semanticsA MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTHSimplified Cut Elimination for Kripke-Platek Set TheoryOn the Performance of Axiom SystemsWell-Ordering Principles in Proof Theory and Reverse MathematicsEpsilon substitution for \(ID_1\) via cut-eliminationA note on the theory SID<ω of stratified inductionPure patterns of order 2Hyperations, Veblen progressions and transfinite iteration of ordinal functionsDeducibility and independence in Beklemishev's autonomous provability calculusReducing ω-model reflection to iterated syntactic reflectionNONCLASSICAL TRUTH WITH CLASSICAL STRENGTH. A PROOF-THEORETIC ANALYSIS OF COMPOSITIONAL TRUTH OVER HYPESystems for non-reflexive consequenceWell ordering principles for iterated \(\Pi^1_1\)-comprehensionA note on ordinal exponentiation and derivatives of normal functionsCharacterizations of ordinal analysisThe omega-rule interpretation of transfinite provability logicThe Π21$\Pi ^1_2$ consequences of a theoryPredicatively unprovable termination of the Ackermannian Goodstein processNotes on models of (partial) Kripke-Feferman truthProvably true sentences across axiomatizations of Kripke's theory of truthEffective cut-elimination for a fragment of modal mu-calculusThe polytopologies of transfinite provability logicA NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTIONMore on Systems of Truth and Predicative ComprehensionProof Theoretic Analysis by Iterated ReflectionA disquotational theory of truth as strong as \(Z_2^-\)About Truth and TypesFrom Subsystems of Analysis to Subsystems of Set TheoryShort note: least fixed points versus least closed pointsAn order-theoretic characterization of the Howard-Bachmann-hierarchyAxiomatic theories of partial ground. II: Partial ground and hierarchies of typed truthOrdinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitionsA Computation of the Maximal Order Type of the Term Ordering on Finite Multisets\(\Pi_1^1\)-comprehension as a well-ordering principleSome notes on truths and comprehensionThe Hydra battle and Cichon's principlePure \(\Sigma_2\)-elementarity beyond the coreIterated Inductive Definitions RevisitedPredicativity and FefermanThe implicit commitment of arithmetical theories and its semantic coreThe middle ground-ancestral logicA Characterisation of Definable NP Search Problems in Peano ArithmeticCut elimination for systems of transparent truth with restricted initial sequentsReference and truthThe Limits of Predicativity RevisitedA Glimpse of $$ \sum_{3} $$-elementarityINFINITARY TABLEAU FOR SEMANTIC TRUTHAXIOMATIZING SEMANTIC THEORIES OF TRUTH?Ackermannian Goodstein sequences of intermediate growthREFLECTION RANKS AND ORDINAL ANALYSIS






This page was built for publication: Proof theory. The first step into impredicativity