Reflections on ``difficult embeddings

DOI10.1007/BF01052731MaRDI QIDQ1344853zbMATH OpenFDO

Authors Andreja Prijatelj

Publication date 22 February 1995

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

Full work available at URL https://doi.org/10.1007/BF01052731

zbMATH Keywords

analysis of sequent derivationsembedding of predicate minimal logic into classical linear logicintuitionistic logic

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Cut-elimination and normal-form theorems (03F05)

Review text

An embedding of predicate minimal logic into classical linear logic CLL, called ``difficult here, is easily proved to be faithful by an analysis of sequent derivations. Extension to intuitionistic first-order logic is obtained by an adjustment of the definition for negation, and turns out to be equivalent to Girard's translation.

Recommendations

• Learning Theory
• scientific article; zbMATH DE number 4064063
• Embeddings of representations
• scientific article; zbMATH DE number 966681
• Essential reflections versus minimal embeddings
• Embedding as a modeling problem
• Embeddings and expansions
• On an embedding problem
• scientific article; zbMATH DE number 1149967

Cites work

• scientific article; zbMATH DE number 1489627 (Why is no real title available?)
• Linear logic
• Modal translations in substructural logics
• Some Syntactical Observations on Linear Logic

Cited in

(2)

• Linearizing intuitionistic implication
• Embedding operations and their application

This page was built for publication: Reflections on ``difficult embeddings

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