scientific article; zbMATH DE number 3346319
From MaRDI portal
Publication:5622162
Cited in
(28)- Set based logic programming
- Beweistheoretische Abgrenzung von Teilsystemen der Analysis
- Fixed points in Peano arithmetic with ordinals
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- The non-constructive operator, fixed point theories with ordinals, and the bar rule
- Ordinals. II: Some applications and a functorial approach
- Systems of explicit mathematics with non-constructive -operator. II
- Proof theory and ordinal analysis
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory
- Systems of explicit mathematics with non-constructive -operator and join
- Heyting-valued interpretations for constructive set theory
- Inductive completeness of logics of programs
- Well-partial orderings and their maximal order types
- From subsystems of analysis to subsystems of set theory
- On the Completeness of Dynamic Logic
- Constructive Zermelo-Fraenkel set theory and the limited principle of omniscience
- Beweistheorie vonKPN
- Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen
- IN MEMORIAM: SOLOMON FEFERMAN (1928–2016)
- Simplified Cut Elimination for Kripke-Platek Set Theory
- On the Performance of Axiom Systems
- Type theory as a foundation for computer science
- Iterated inductive definitions revisited
- Two applications of analytic functors
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- Fast Goodstein walks
- Foundations for analysis and proof theory
- Ordinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5622162)
