Proving open properties by induction
From MaRDI portal
Publication:1112816
DOI10.1016/0020-0190(88)90126-3zbMath0661.04002OpenAlexW2162849813MaRDI QIDQ1112816
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90126-3
Related Items (20)
A universal Krull-Lindenbaum theorem ⋮ Coq formalization of the higher-order recursive path ordering ⋮ The Jacobson radical for an inconsistency predicate ⋮ On induction principles for partial orders ⋮ Certified Kruskal’s Tree Theorem ⋮ A universal algorithm for Krull's theorem ⋮ The equivalence of bar recursion and open recursion ⋮ Eliminating disjunctions by disjunction elimination ⋮ ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION ⋮ Well Quasi-orders and the Functional Interpretation ⋮ A Mechanized Proof of Higman’s Lemma by Open Induction ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ Lindenbaum’s Lemma via Open Induction ⋮ On the Constructive and Computational Content of Abstract Mathematics ⋮ An induction principle over real numbers ⋮ Programs from proofs using classical dependent choice ⋮ Constructing Gröbner bases for Noetherian rings ⋮ Decision procedure of some relevant logics: a constructive perspective ⋮ The computational significance of Hausdorff's maximal chain principle ⋮ Syntax for Semantics: Krull’s Maximal Ideal Theorem
Uses Software
Cites Work
This page was built for publication: Proving open properties by induction
