Constructive topology and combinatorics
From MaRDI portal
Publication:4594260
DOI10.1007/BFb0021089zbMath1434.03143OpenAlexW1541955821MaRDI QIDQ4594260
Publication date: 17 November 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0021089
Other constructive mathematics (03F65) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items
A universal Krull-Lindenbaum theorem, A constructive topological proof of van der Waerden's theorem, The equivalence of bar recursion and open recursion, Lindenbaum’s Lemma via Open Induction, A constructive proof of the Heine-Borel covering theorem for formal reals, Programs from proofs using classical dependent choice, Constructing Gröbner bases for Noetherian rings, Forcing in Proof Theory, Constructive decision via redundancy-free proof-search, Space of valuations, Dependent choice as a termination principle, Decision procedure of some relevant logics: a constructive perspective
