The following pages link to Proofs and Computations (Q3110202):
Displaying 42 items.
- A stream calculus of bottomed sequences for real number computation (Q265834) (← links)
- Limit spaces with approximations (Q290635) (← links)
- Atomicity, coherence of information, and point-free structures (Q290637) (← links)
- Principles for object-linguistic consequence: from logical to irreflexive (Q722029) (← links)
- Eliminating disjunctions by disjunction elimination (Q1688959) (← links)
- Arithmetical conservation results (Q1688961) (← links)
- On preserving the computational content of mathematical proofs: toy examples for a formalising strategy (Q2117791) (← links)
- An algorithmic version of Zariski's lemma (Q2117812) (← links)
- Intuitionistic fixed point logic (Q2220485) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- An adequacy theorem for dependent type theory (Q2311883) (← links)
- A constructive notion of codimension (Q2445023) (← links)
- Lookahead analysis in exact real arithmetic with logical methods (Q2680994) (← links)
- A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory (Q2683776) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Extracting a DPLL Algorithm (Q3178287) (← links)
- About Truth and Types (Q3305551) (← links)
- Higman’s Lemma and Its Computational Content (Q3305561) (← links)
- Pointwise Transfinite Induction and a Miniaturized Predicativity (Q3305563) (← links)
- On the Constructive and Computational Content of Abstract Mathematics (Q3305627) (← links)
- From Mathesis Universalis to Provability, Computability, and Constructivity (Q3305633) (← links)
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Q3305635) (← links)
- Nonflatness and totality (Q4611200) (← links)
- GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION (Q4959664) (← links)
- Direct spectra of Bishop spaces and their limits (Q4989398) (← links)
- (Q4989402) (← links)
- (Q5028422) (← links)
- Limits of real numbers in the binary signed digit representation (Q5043582) (← links)
- Proof-relevance in Bishop-style constructive mathematics (Q5055489) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- A note on equality in finite‐type arithmetic (Q5108108) (← links)
- An intuitionistic formula hierarchy based on high‐school identities (Q5108846) (← links)
- Normal forms, linearity, and prime algebraicity over nonflat domains (Q5109211) (← links)
- (Q5109510) (← links)
- Computing with continuous objects: a uniform co-inductive approach (Q5156773) (← links)
- Cut Elimination, Substitution and Normalisation (Q5213610) (← links)
- Tiered Arithmetics (Q5214784) (← links)
- Feferman and the Truth (Q5214789) (← links)
- Program extraction in exact real arithmetic (Q5740678) (← links)
- (Q5856423) (← links)
- SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS (Q6041342) (← links)
- Maximal elements with minimal logic (Q6161463) (← links)
