The following pages link to Mark Bickford (Q392279):
Displaying 18 items.
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- (Q865633) (redirect page) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Vladimir Voevodsky -- work and destiny (Q1708850) (← links)
- Implementing Euclid's straightedge and compass constructions in type theory (Q2631963) (← links)
- Formalizing Moessner's theorem and generalizations in \textsc{Nuprl} (Q2667184) (← links)
- Knowledge-Based Synthesis of Distributed Systems Using Event Structures (Q3003333) (← links)
- (Q4037115) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- (Q4790655) (← links)
- (Q4981439) (← links)
- Connectedness of the continuum in intuitionistic mathematics (Q5109234) (← links)
- (Q5144620) (← links)
- Computability Beyond Church-Turing via Choice Sequences (Q5145297) (← links)
- A Verified Theorem Prover Backend Supported by a Monotonic Library (Q5222980) (← links)
- Bar Induction is Compatible with Constructive Type Theory (Q5244386) (← links)
- Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types (Q5327349) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705941) (← links)
