Proving consistency of equational theories in bounded arithmetic (Q4532615): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Term rewriting theory for the primitive recursive functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unprovability of consistency statements in fragments of bounded arithmetic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A term rewriting characterization of the polytime functions and related complexity classes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths / rank | |||
Normal rank | |||
Latest revision as of 10:21, 4 June 2024
scientific article; zbMATH DE number 1749911
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proving consistency of equational theories in bounded arithmetic |
scientific article; zbMATH DE number 1749911 |
Statements
Proving consistency of equational theories in bounded arithmetic (English)
0 references
29 May 2003
0 references
bounded arithmetic
0 references
consistency proofs
0 references
equational theories
0 references
Church-Rosser property
0 references
proof system
0 references
0 references
