Meaning and computing: two approaches to computable propositions (Q2148782)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Meaning and computing: two approaches to computable propositions |
scientific article; zbMATH DE number 7547736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Meaning and computing: two approaches to computable propositions |
scientific article; zbMATH DE number 7547736 |
Statements
Meaning and computing: two approaches to computable propositions (English)
0 references
24 June 2022
0 references
computable proposition
0 references
sense-denotation distinction
0 references
algorithmic theory of meaning
0 references
procedural semantics
0 references
constructive type theory
0 references
transparent intensional logic
0 references
0 references
0.7086321115493774
0 references
0.6877906322479248
0 references
0.6831122040748596
0 references
0.6824173927307129
0 references
0.6742631793022156
0 references
