Hauptsatz for higher order logic
From MaRDI portal
Publication:5549033
DOI10.2307/2270331zbMATH Open0164.31002OpenAlexW1985234321MaRDI QIDQ5549033FDOQ5549033
Authors: Dag Prawitz 
Publication date: 1968
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270331
Cites Work
Cited In (23)
- A simple proof that super-consistency implies cut elimination
- Ein syntaktischer Beweis für die Zulässigkeit der Schnittregel im Kalkül von Schütte für die intuitionistische Typenlogik
- Ein starker Normalisationssatz für die intuitionistische Typentheorie
- A semantics for \(\lambda \)Prolog
- Cut-elimination for quantified conditional logic
- Mechanized metatheory revisited
- Prawitz, Proofs, and Meaning
- Ein Ausgezeichnetes Modell Für Die Intuitionistische Typenlogik
- Typing and computational properties of lambda expressions
- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
- Extended Curry-Howard terms for second-order logic
- A cut-free calculus for second-order Gödel logic
- Analytic tableaux for higher-order logic with choice
- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms
- Memories of Kurt Schütte and the logic group in Munich: A personal report
- Vollständigkeit und Schnittelimination in der intuitionistischen Typenlogik
- Completeness of type assignment systems with intersection, union, and type quantifiers
- A compact representation of proofs
- Polymorphism and the obstinate circularity of second order logic: a victims' tale
- Abstract deduction and inferential models for type theory
- Extended First-Order Logic
- On the convergence of reduction-based and model-based methods in proof theory
- On Takeuti's early view of the concept of set
This page was built for publication: Hauptsatz for higher order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5549033)
