Skip to main content
Chapter
Licensed
Unlicensed Requires Authentication

Axiomatizing Truth: Why and How?

For Helmut Schwichtenberg on the occasion of his 70th birthday
Become an author with De Gruyter Brill
Explore this Subject How to publish with us
Logic, Construction, Computation
This chapter is in the book Logic, Construction, Computation

Chapters in this book

  1. Frontmatter i
  2. Preface 2
  3. Contents ix
  4. Contributors 7
  5. A New Use of Friedman’s Translation: Interactive Realizability 11
  6. Polymorphic Logic 51
  7. Constructive Solutions of Ordinary Differential Equations 67
  8. A Nonstandard Hierarchy Comparison Theorem for the Slow and Fast Growing Hierarchy 79
  9. Conservativity of transitive closure over weak constructive operational set theory 91
  10. Formal Baire Space in Constructive Set Theory 123
  11. Functional Interpretations of Classical and Constructive Set Theory 137
  12. Weak Theories of Truth and Explicit Mathematics 157
  13. Axiomatizing Truth: Why and How? 185
  14. On the Strength of some Semi-Constructive Theories 201
  15. On the Relation Between Various Negative Translations 227
  16. A Finite Axiomatisation of Inductive-Inductive Definitions 259
  17. Some Conservative Extension Results on Classical and Intuitionistic Sequent Calculi 289
  18. About the Strength of Operational Regularity 305
  19. Non-Deterministic Epsilon Substitution for ID1: Effective Proof 325
  20. Another Unique Weak König’s Lemma WKL!! 343
  21. The Continuous Functionals as Limit Spaces 353
  22. Provably Recursive Functions of Reflection 381
  23. A Hierarchy of Ramified Theories Below PRA 475
  24. Representing L-Domains as Information Systems 501
https://doi.org/10.1515/9783110324921.185

Chapters in this book

  1. Frontmatter i
  2. Preface 2
  3. Contents ix
  4. Contributors 7
  5. A New Use of Friedman’s Translation: Interactive Realizability 11
  6. Polymorphic Logic 51
  7. Constructive Solutions of Ordinary Differential Equations 67
  8. A Nonstandard Hierarchy Comparison Theorem for the Slow and Fast Growing Hierarchy 79
  9. Conservativity of transitive closure over weak constructive operational set theory 91
  10. Formal Baire Space in Constructive Set Theory 123
  11. Functional Interpretations of Classical and Constructive Set Theory 137
  12. Weak Theories of Truth and Explicit Mathematics 157
  13. Axiomatizing Truth: Why and How? 185
  14. On the Strength of some Semi-Constructive Theories 201
  15. On the Relation Between Various Negative Translations 227
  16. A Finite Axiomatisation of Inductive-Inductive Definitions 259
  17. Some Conservative Extension Results on Classical and Intuitionistic Sequent Calculi 289
  18. About the Strength of Operational Regularity 305
  19. Non-Deterministic Epsilon Substitution for ID1: Effective Proof 325
  20. Another Unique Weak König’s Lemma WKL!! 343
  21. The Continuous Functionals as Limit Spaces 353
  22. Provably Recursive Functions of Reflection 381
  23. A Hierarchy of Ramified Theories Below PRA 475
  24. Representing L-Domains as Information Systems 501
Downloaded on 1.5.2026 from https://www.degruyterbrill.com/document/doi/10.1515/9783110324921.185/html?lang=en
Scroll to top button