Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic λ-Calculus

DOI10.1007/978-3-540-73147-4_8zbMATH Open1186.03024OpenAlexW1525695252MaRDI QIDQ3608816FDOQ3608816

Ryo Takemura, Mitsuhiro Okada

Publication date: 6 March 2009

Published in: Rewriting, Computation and Proof (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73147-4_8

Recommendations

• Typed Lambda Calculi and Applications
• On the strong semantical completeness of the intuitionistic predicate calculus
• The \(\lambda \)-calculus and the unity of structural proof theory
• Lambek calculus and its relational semantics: Completeness and incompleteness
• On the completeness of the Lambek calculus with respect to relativized relational semantics
• A note on the proof theory of the \(\lambda \Pi\)-calculus
• scientific article; zbMATH DE number 2209442
• scientific article; zbMATH DE number 475195
• Completeness in Proof-Theoretic Semantics
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (2)

• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
• Typed Lambda Calculi and Applications

This page was built for publication: Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic λ-Calculus

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