The following pages link to Stefano Berardi (Q428881):
Displaying 50 items.
- Internal models of system F for decompilation (Q428882) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- Games with 1-backtracking (Q636360) (← links)
- Retractions of dI-domains as a model for Type:Type (Q805221) (← links)
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca (Q930863) (← links)
- Toward the interpretation of non-constructive reasoning as non-monotonic learning (Q1004290) (← links)
- A constructive valuation semantics for classical logic (Q1355127) (← links)
- A parallel game semantics for linear logic (Q1360314) (← links)
- The simply typed theory of \(\beta\)-conversion has no maximum extension (Q1383152) (← links)
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs (Q1798782) (← links)
- Building continuous webbed models for system F (Q1826624) (← links)
- A full continuous model of polymorphism (Q1853594) (← links)
- Krivine's intuitionistic proof of classical completeness (for countable languages) (Q1887656) (← links)
- A strong normalization result for classical logic (Q1902976) (← links)
- A symmetric lambda calculus for classical program extraction (Q1917084) (← links)
- Some intuitionistic equivalents of classical principles for degree 2 formulas (Q2368911) (← links)
- A sequent calculus for limit computable mathematics (Q2482845) (← links)
- Interactive Learning-Based Realizability for Heyting Arithmetic with EM1 (Q2786136) (← links)
- Non-Commutative Infinitary Peano Arithmetic (Q2915710) (← links)
- Interactive Realizers (Q2946659) (← links)
- (Q2958512) (← links)
- Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic (Q2968410) (← links)
- Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System (Q2988375) (← links)
- (Q3024822) (← links)
- (Q3024824) (← links)
- (Q3024898) (← links)
- Positive Arithmetic Without Exchange Is a Subclassical Logic (Q3498443) (← links)
- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) (Q3540181) (← links)
- Internal Normalization, Compilation and Decompilation for System ${\mathcal F}_{\beta\eta}$ (Q3558340) (← links)
- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves (Q3612620) (← links)
- Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1 (Q3637184) (← links)
- Equalization of finite flowers (Q3807193) (← links)
- (Q3970572) (← links)
- On the computational content of the axiom of choice (Q4212925) (← links)
- Approximating classical theorems (Q4228077) (← links)
- (Q4247298) (← links)
- Intuitionistic completeness for first order classical logic (Q4254637) (← links)
- (Q4263862) (← links)
- (Q4281464) (← links)
- An application of PER models to program extraction (Q4282806) (← links)
- (Q4364394) (← links)
- βη-complete models for System <i>F</i> (Q4405696) (← links)
- A generalization of a conservativity theorem for classical versus intuitionistic arithmetic (Q4458699) (← links)
- (Q4472544) (← links)
- (Q4490745) (← links)
- (Q4513574) (← links)
- Non-monotonic Pre-fix Points and Learning (Q4589611) (← links)
- Knowledge Spaces and the Completeness of Learning Strategies (Q4649539) (← links)
- Classical logic as limit completion (Q4657754) (← links)
- (Q4699354) (← links)
