Automatic proofs by induction in theories without constructors (Q1824382): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Process algebra for synchronous communication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3894958 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3785921 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3703288 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3725540 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880309 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3719824 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3687683 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3028369 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A complete proof of correctness of the Knuth-Bendix completion algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proofs by induction in equational theories with constructors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completion of a Set of Rules Modulo a Set of Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automatic proofs by induction in theories without constructors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5581665 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3713575 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An overview of the Tecton proof system / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3347863 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3698310 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3716284 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3696496 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3783518 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0890-5401(89)90062-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2056774266 / rank | |||
Normal rank |
Latest revision as of 09:24, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Automatic proofs by induction in theories without constructors |
scientific article |
Statements
Automatic proofs by induction in theories without constructors (English)
0 references
1989
0 references
Inductionless induction
0 references
equational reasoning
0 references
initial algebra
0 references
Knuth- Bendix completion algorithm
0 references
inductive completion algorithm
0 references
inductive reducibility
0 references
inductive co-reducibility
0 references
term rewriting systems
0 references
0 references