A Computational Interpretation of Forcing in Type Theory (Q5253929): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Impact of the Lambda Calculus in Logic and Computer Science / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3679172 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5604461 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The discovery of forcing. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Note on Forcing and Type Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a hitherto unexploited extension of the finitary standpoint / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relativized realizability in intuitionistic arithmetic of all finite types / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4218119 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructivism in mathematics. An introduction. Volume II / rank | |||
Normal rank |
Latest revision as of 04:13, 10 July 2024
scientific article; zbMATH DE number 6443424
Language | Label | Description | Also known as |
---|---|---|---|
English | A Computational Interpretation of Forcing in Type Theory |
scientific article; zbMATH DE number 6443424 |
Statements
A Computational Interpretation of Forcing in Type Theory (English)
0 references
5 June 2015
0 references
type theory
0 references
computational interpretation of forcing
0 references