Completeness of a prover for dense linear orders

DOI10.1007/BF00263449MaRDI QIDQ1187856zbMATH OpenFDO

Authors Larry M. Hines

Publication date 23 July 1992

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00263449

zbMATH Keywords

automated reasoningcompletenessdense linear orders

Mathematics Subject Classification ID

Recommendations

• Computability-theoretic and proof-theoretic aspects of partial and linear orderings
• Computable linearizations of well-partial-orderings
• scientific article; zbMATH DE number 5582998
• Definable combinatorics with dense linear orders
• Proving linearizability using partial orders
• Completeness results for inequality provers
• Computability on linear orderings enriched with predicates
• Strong completeness of provability logic for ordinal spaces
• Completeness for linear continuous logic
• scientific article; zbMATH DE number 1978362

Cited in

(6)

• scientific article; zbMATH DE number 5582998 (Why is no real title available?)
• scientific article; zbMATH DE number 1978362 (Why is no real title available?)
• Cyclic connections
• Theorem proving in cancellative abelian monoids (extended abstract)
• Str\(\dotplus\)ve and integers
• Ordered chaining for total orderings

This page was built for publication: Completeness of a prover for dense linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187856)