Search Sciweavers | Sciweavers

We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The ...

Fernando Ferreira, Ana Nunes

claim paper

Read More »

110

click to vote

LICS
2007
IEEE

103views Automated Reasoning» more LICS 2007»

Modified Realizability Interpretation of Classical Linear Logic

15 years 9 months ago

Download www.eecs.qmul.ac.uk

Paulo Oliva

claim paper

Read More »

click to vote

TLCA
1993
Springer

109views Theoretical Computer Science» more TLCA 1993»

Modified Realizability Toposes and Strong Normalization Proofs

15 years 7 months ago

Download www.dpmms.cam.ac.uk

J. M. E. Hyland, C.-H. Luke Ong

claim paper

Read More »

click to vote

TYPES
1993
Springer

104views Formal Methods» more TYPES 1993»

Proving Strong Normalization of CC by Modifying Realizability Semantics

15 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers