Pages that link to "Item:Q1166517"
From MaRDI portal
The following pages link to Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies (Q1166517):
Displayed 50 items.
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees (Q582289) (← links)
- Type-theoretic interpretation of iterated, strictly positive inductive definitions (Q688845) (← links)
- Extended bar induction in applicative theories (Q753810) (← links)
- Fragments of arithmetic (Q762484) (← links)
- Foundations for analysis and proof theory (Q798634) (← links)
- Generalizing classical and effective model theory in theories of operations and classes (Q810008) (← links)
- The constructive Hilbert program and the limits of Martin-Löf type theory (Q813417) (← links)
- Ordinal arithmetic based on Skolem hulling (Q866560) (← links)
- A logic of abstraction related to finite constructive number classes (Q910401) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- Ordinal notations based on a weakly Mahlo cardinal (Q920986) (← links)
- The metamathematics of ergodic theory (Q1006602) (← links)
- Patterns of resemblance of order 2 (Q1011757) (← links)
- Addendum to ``Countable algebra and set existence axioms'' (Q1063594) (← links)
- An independence result for \((\Pi^ 1_ 1-CA)+BI\) (Q1097882) (← links)
- Ordinal notations based on a hierarchy of inaccessible cardinals (Q1109768) (← links)
- Monotone inductive definitions in a constructive theory of functions and classes (Q1115865) (← links)
- Between constructive mathematics and PROLOG (Q1173742) (← links)
- Fixed points in Peano arithmetic with ordinals (Q1210139) (← links)
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\) (Q1295369) (← links)
- Well-ordering proofs for Martin-Löf type theory (Q1295372) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I (Q1314542) (← links)
- Realizability interpretation of generalized inductive definitions (Q1331920) (← links)
- Proof theory of reflection (Q1332853) (← links)
- The strength of some Martin-Löf type theories (Q1344548) (← links)
- On the proof-theoretic strength of monotone induction in explicit mathematics (Q1356976) (← links)
- Inductively generated formal topologies. (Q1412832) (← links)
- Saturated models of universal theories (Q1861531) (← links)
- Universes over Frege structures (Q1861539) (← links)
- An intensional fixed point theory over first order arithmetic (Q1877095) (← links)
- Understanding uniformity in Feferman's explicit mathematics (Q1899146) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Second order theories with ordinals and elementary comprehension (Q1908814) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- On the unity of duality (Q2482843) (← links)
- CZF and second order arithmetic (Q2498896) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator and join (Q2563984) (← links)
- First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo (Q2758045) (← links)
- Choice principles, the bar rule and autonomously iterated comprehension schemes in analysis (Q3039341) (← links)
- A theory of formal truth arithmetically equivalent to ID<sub>1</sub> (Q3197819) (← links)
- ϱ-inaccessible ordinals, collapsing functions and a recursive notation system (Q3335775) (← links)
- The proof-theoretic analysis of transfinitely iterated quasi least fixed points (Q3410669) (← links)
- Generalizations of the Kruskal-Friedman theorems (Q3491541) (← links)
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 (Q3616431) (← links)
- On the Completeness of Dynamic Logic (Q3617722) (← links)
- Dual Calculus with Inductive and Coinductive Types (Q3636828) (← links)
- The strength of admissibility without foundation (Q3710526) (← links)
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees (Q3731598) (← links)
- A boundedness theorem in <b>ID</b><sub>1</sub>(<i>W</i>) (Q3760543) (← links)