Proving open properties by induction
From MaRDI portal
Recommendations
Cites work
Cited in
(22)- Syntax for semantics: Krull's maximal ideal theorem
- The equivalence of bar recursion and open recursion
- The computational significance of Hausdorff's maximal chain principle
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- A Mechanized Proof of Higman’s Lemma by Open Induction
- A universal Krull-Lindenbaum theorem
- On the constructive and computational content of abstract mathematics
- Coq formalization of the higher-order recursive path ordering
- Certified Kruskal's tree theorem
- Constructing Gröbner bases for Noetherian rings
- A universal algorithm for Krull's theorem
- Lindenbaum's lemma via open induction
- Decision procedure of some relevant logics: a constructive perspective
- Programs from proofs using classical dependent choice
- Some new double induction and superinduction principles
- On induction principles for partial orders
- The Jacobson radical for an inconsistency predicate
- Well quasi-orders and the functional interpretation
- An induction principle over real numbers
- Eliminating disjunctions by disjunction elimination
- Eliminating disjunctions by disjunction elimination
- scientific article; zbMATH DE number 4033743 (Why is no real title available?)
This page was built for publication: Proving open properties by induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112816)