Reflections on ``difficult'' embeddings (Q1344853)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 724113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reflections on ``difficult'' embeddings |
scientific article; zbMATH DE number 724113 |
Statements
Reflections on ``difficult'' embeddings (English)
0 references
22 February 1995
0 references
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.
0 references
intuitionistic logic
0 references
embedding of predicate minimal logic into classical linear logic
0 references
analysis of sequent derivations
0 references
0 references
0.8264171
0 references
0 references
