The following pages link to (Q3679172):
Displayed 50 items.
- Explicit mathematics: power types and overloading (Q556826) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Sets, complements and boundaries (Q675783) (← links)
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation (Q688431) (← links)
- On specifications, subset types and interpretation of proposition in type theory (Q688736) (← links)
- Type-theoretic interpretation of iterated, strictly positive inductive definitions (Q688845) (← links)
- Equivalents of the (weak) fan theorem (Q703836) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Preference, indifference, and Markov's principle (Q751944) (← links)
- Extended bar induction in applicative theories (Q753810) (← links)
- Extraction of redundancy-free programs from constructive natural deduction proofs (Q808284) (← links)
- Gentzen calculi for the existence predicate (Q817698) (← links)
- Mathematics based on incremental learning -- excluded middle and inductive inference (Q817838) (← links)
- Partial Horn logic and Cartesian categories (Q866572) (← links)
- Computability of analog networks (Q870263) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- Rationality, computability, and complexity (Q920814) (← links)
- Fixed point theory in weak second-order arithmetic (Q922541) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- On the syntax of Martin-Löf's type theories (Q1099173) (← links)
- Between constructive mathematics and PROLOG (Q1173742) (← links)
- On the status of proofs by contradiction in the seventeenth century (Q1182171) (← links)
- Finite type structures within combinatory algebras (Q1182485) (← links)
- Extensions and fixed points of contractive maps in \(\mathbb{R}^ n\) (Q1191646) (← links)
- Extension of combinatory logic to a theory of combinatory representation (Q1193865) (← links)
- A transfer theorem in constructive \(p\)-adic algebra (Q1194243) (← links)
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games (Q1196208) (← links)
- A theory for program and data type specification (Q1199933) (← links)
- Self-witnessing polynomial-time complexity and prime factorization (Q1200292) (← links)
- Hilbert's \(\varepsilon{}\)-operator and classical logic (Q1208146) (← links)
- Constructive mathematics: a foundation for computable analysis (Q1292399) (← links)
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\) (Q1295369) (← links)
- Well-ordering proofs for Martin-Löf type theory (Q1295372) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- Realizability interpretation of coinductive definitions and program synthesis with streams (Q1314420) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I (Q1314542) (← links)
- Realizability interpretation of generalized inductive definitions (Q1331920) (← links)
- The strength of some Martin-Löf type theories (Q1344548) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- On the proof-theoretic strength of monotone induction in explicit mathematics (Q1356976) (← links)
- Extensional realizability (Q1356980) (← links)
- The constructive theory of preference relations on a locally compact space. II (Q1364438) (← links)
- Provability in principle and controversial constructivistic principles (Q1372941) (← links)
- Unique existence, approximate solutions, and countable choice. (Q1427789) (← links)
- A constructive theory of point-set nearness. (Q1427791) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Ishihara's proof technique in constructive analysis (Q1433041) (← links)
- Polynat in PER models (Q1434360) (← links)
- Functional interpretation of Aczel's constructive set theory (Q1577478) (← links)
- The unfolding of non-finitist arithmetic (Q1577479) (← links)