Separating Markov's principles
From MaRDI portal
Cites work
- ``Upon this quote I will build my Church thesis
- A remark on free choice sequences and the topological completeness proofs
- Arguments for the Continuity Principle
- Completeness theorems for first-order logic analysed in constructive type theory
- Completeness theorems for first-order logic analysed in constructive type theory
- Constructing unprejudiced extensional type theories with choices via modalities
- Constructive Sheaf Semantics
- Constructivism in mathematics. An introduction. Volume I
- Failure is not an option. An exceptional type theory
- Forcing for IZF in sheaf toposes
- Formal systems for some branches of intuitionistic analysis
- General recursive functions of natural numbers
- Homotopy type theory. Univalent foundations of mathematics
- scientific article; zbMATH DE number 3867322 (Why is no real title available?)
- scientific article; zbMATH DE number 3910392 (Why is no real title available?)
- scientific article; zbMATH DE number 4002093 (Why is no real title available?)
- scientific article; zbMATH DE number 3552491 (Why is no real title available?)
- scientific article; zbMATH DE number 1342277 (Why is no real title available?)
- scientific article; zbMATH DE number 510786 (Why is no real title available?)
- scientific article; zbMATH DE number 1795233 (Why is no real title available?)
- scientific article; zbMATH DE number 2204804 (Why is no real title available?)
- scientific article; zbMATH DE number 3216177 (Why is no real title available?)
- scientific article; zbMATH DE number 3222098 (Why is no real title available?)
- scientific article; zbMATH DE number 3237808 (Why is no real title available?)
- scientific article; zbMATH DE number 3317730 (Why is no real title available?)
- Inductive continuity via Brouwer trees
- Nominal sets. Names and symmetry in computer science
- Notions of anonymous existence in Martin-Löf type theory
- On weak completeness of intuitionistic predicate logic
- Realizing continuity using stateful computations
- Recursively enumerable sets of positive integers and their decision problems
- Russian constructivism in a prefascist theory
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- Separating Markov's principles
- Sheaf models for choice sequences
- Sheaves in geometry and logic: a first introduction to topos theory
- Subsystems of second order arithmetic
- The independence of Markov's principle in type theory
- The Invalidity of Markoff's Schema
- The weak König lemma, Brouwer's fan theorem, De Morgan's law, and dependent choice
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Weak call-by-value lambda calculus as a model of computation in Coq
This page was built for publication: Separating Markov's principles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970250)