Syntactical and semantical properties of simple type theory

DOI10.2307/2963525MaRDI QIDQ3845367zbMATH OpenOpenAlexFDO

Authors Kurt Schütte

Publication date 1960

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

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

zbMATH Keywords

mathematical logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites work

• scientific article; zbMATH DE number 3167150 (Why is no real title available?)
• Ein System des Verknüpfenden Schliessens
• Eine Bemerkung zu Henkin's Beweis für die Vollständigkeit des Prädikatenkalküls der ersten Stufe

Cited in

(33)

• Cut-elimination for quantified conditional logic
• On non-deterministic functional completeness
• Semantical approach to cut elimination and subformula property in modal logic
• Reminiscences of Kurt Schütte
• Paraconsistency and the need for infinite semantics
• A cut-free calculus for second-order Gödel logic
• Simple type theory of Gentzen style with the inference of extensionality
• Lorenzen Between Gentzen and Schütte
• Ein starker Normalisationssatz für die intuitionistische Typentheorie
• Electronic communication of mathematics and the interaction of computer algebra systems and proof assistants
• Natural Deduction, Inference, and Consistency
• Setoid type theory -- a syntactic translation
• Completeness of cut-free type theories
• Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic
• 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
• Cut elimination, identity elimination, and interpolation in super-Belnap logics
• A simple proof that super-consistency implies cut elimination
• A nonconstructive proof of Gentzen’s Hauptsatz for second order predicate logic
• Cut-Elimination for SBL
• Proofs with monotone cuts
• One step is enough
• Is Cantor's theorem a dialetheia? Variations on a paraconsistent approach to Cantor's theorem
• Prawitz, Proofs, and Meaning
• Is cut-free logic fit for unrestricted abstraction?
• Schnittelimination in einem Teilsystem der einfachen Typenlogik
• Simple Types in Type Theory: Deep and Shallow Encodings
• scientific article; zbMATH DE number 6923849 (Why is no real title available?)
• Vollständigkeit und Schnittelimination in der intuitionistischen Typenlogik
• Category theory in Isabelle/HOL as a basis for meta-logical investigation
• Simply-typed underdeterminism
• A semantics for \(\lambda \)Prolog
• From probability measures to each Lévy triplet and back

This page was built for publication: Syntactical and semantical properties of simple type theory

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