The following pages link to (Q5344164):
Displaying 50 items.
- Effective results on a fixed point algorithm for families of nonlinear mappings (Q331050) (← links)
- The equivalence of bar recursion and open recursion (Q400424) (← links)
- On bounded functional interpretations (Q424545) (← links)
- Bar recursion over finite partial functions (Q515562) (← links)
- Realizability models and implicit complexity (Q534712) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- The modified realizability topos (Q678851) (← links)
- Operational set theory and small large cardinals (Q731889) (← links)
- Extensional models for polymorphism (Q749518) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- Program extraction from normalization proofs (Q817701) (← links)
- Functional interpretations of linear and intuitionistic logic (Q964504) (← links)
- A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
- The metamathematics of ergodic theory (Q1006602) (← links)
- Injecting uniformities into Peano arithmetic (Q1006608) (← links)
- Realizability interpretation of proofs in constructive analysis (Q1015381) (← links)
- A proof description language and its reduction system (Q1055769) (← links)
- Polymorphic type inference and containment (Q1110312) (← links)
- A small complete category (Q1112159) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- Total sets and objects in domain theory (Q1210138) (← links)
- Arithmetical conservation results (Q1688961) (← links)
- A realizability interpretation for classical analysis (Q1762729) (← links)
- Uniform Heyting arithmetic (Q1772775) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Polymorphic extensions of simple type structures. With an application to a bar recursive minimization (Q1919547) (← links)
- Computation on abstract data types. The extensional approach, with an application to streams (Q1923575) (← links)
- On preserving the computational content of mathematical proofs: toy examples for a formalising strategy (Q2117791) (← links)
- Intuitionistic fixed point logic (Q2220485) (← links)
- An application of proof mining to nonlinear iterations (Q2453072) (← links)
- Strongly uniform bounds from semi-constructive proofs (Q2498902) (← links)
- A parametrised functional interpretation of Heyting arithmetic (Q2659105) (← links)
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces (Q2682909) (← links)
- Light Dialectica program extraction from a classical Fibonacci proof (Q2864211) (← links)
- Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
- A Computable Solution to Partee’s Temperature Puzzle (Q2964003) (← links)
- Extracting a DPLL Algorithm (Q3178287) (← links)
- Base-Complexity Classifications of QCB $$_0$$ 0 -Spaces (Q3195692) (← links)
- On the fundamental conjecture of GLC, VI (Q3292575) (← links)
- Well Quasi-orders and the Functional Interpretation (Q3295153) (← links)
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Q3305635) (← links)
- Internal Density Theorems for Hierarchies of Continuous Functionals (Q3507463) (← links)
- Dialectica Interpretation with Fine Computational Control (Q3576085) (← links)
- From Coinductive Proofs to Exact Real Arithmetic (Q3644745) (← links)
- Nonflatness and totality (Q4611200) (← links)
- Two different strong normalization proofs? (Q4645812) (← links)
- The greatest common divisor: A case study for program extraction from classical proofs (Q4647568) (← links)
- (Q4989411) (← links)
