Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Finite approach to the problem of optimizing theorem-proving algorithms

From MaRDI portal
Publication:1255329
Jump to:navigation, search

DOI10.1007/BF01091744zbMath0401.68075MaRDI QIDQ1255329

A. O. Slisenko

Publication date: 1978

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)


zbMATH Keywords

Predicate CalculusFormal SystemOptimizing Theorem-Proving Algorithms


Mathematics Subject Classification ID

Classical first-order logic (03B10) Mechanization of proofs and logical operations (03B35) Algorithms in computer science (68W99)


Related Items (1)

New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems




Cites Work

  • A property of enumerable sets containing complexly deducible formulas
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Finite approach to the problem of optimizing theorem-proving algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1255329&oldid=13349149"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 09:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki