A survey of proof theory

DOI10.2307/2270324zbMATH Open0177.01002OpenAlexW1978270323MaRDI QIDQ5569099FDOQ5569099

Authors: Georg Kreisel 

Publication date: 1968

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2270324

zbMATH Keywords

algebraic logic, model theory

Cites Work

• Title not available (Why is that?)
• The consistency of arithmetics
• Introduction to model theory and to the metamathematics of algebra
• Consistency proofs of subsystems of classical analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Die Widerspruchsfreiheit der allgemeinen Mengenlehre
• Persistent and invariant formulas relative to theories of higher order
• A nonconstructive proof of Gentzen’s Hauptsatz for second order predicate logic
• First order properties of pairs of cardinals
• Title not available (Why is that?)
• Deduction-preserving “recursive isomorphisms” between theories
• 1 — Consistency and faithful interpretations
• Some Generalisations of the Notion of Well Ordering

Cited In (34)

• A note on the elimination rules
• The fundamental problem of general proof theory
• Consistency proof without transfinite induction for a formal system for turing machines
• Fragments of arithmetic
• On provability logics of Niebergall arithmetic
• The Galvin-Prikry theorem and set existence axioms
• Theory of proofs (arithmetic and analysis)
• Notation systems for infinitary derivations
• A study of Kripke-type models for some modal logics by Gentzen's sequential method
• Truth, reflection and hierarchies
• Title not available (Why is that?)
• An axiomatic approach to self-referential truth
• Reasoning in Dynamic Logic about Program Termination
• Gentzen reduction revisited
• Hilbert's ‘Verunglückter Beweis’, the first epsilon theorem, and consistency proofs
• Current research on Gödel's incompleteness theorems
• Reduction of finite and infinite derivations
• The versatility of universality in \textit{Principia mathematica}
• Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
• On a generalized modularization theorem
• Pa-Beweisbare ∀∃-Formeln
• Inferentializing semantics
• On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
• Jean van Heijenoort's contributions to proof theory and its history
• Proof-theoretical analysis: Weak systems of functions and classes
• … and so on: Schütte on Naming Ordinals
• The prehistory of the subsystems of second-order arithmetic
• Finite investigations of transfinite derivations
• Foundations for analysis and proof theory
• Theory of Zermelo without power set axiom and the theory of Zermelo- Fraenkel without power set axiom are relatively consistent
• A new model construction by making a detour via intuitionistic theories. IV: A closer connection between \(\mathrm{KP} \omega\) and \(\mathrm{BI}\).
• INCOMPLETENESS VIA PARADOX AND COMPLETENESS
• Constructive Zermelo-Fraenkel set theory and the limited principle of omniscience
• On Takeuti's early view of the concept of set

This page was built for publication: A survey of proof theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5569099)