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

Obvious inferences

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

DOI10.1007/BF00247436zbMath0641.68141OpenAlexW2912720603MaRDI QIDQ1100932

Piotr Rudnicki

Publication date: 1987

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

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


zbMATH Keywords

theorem provingunificationpredicate logicproof checkinglogic teaching


Mathematics Subject Classification ID


Related Items

Semi-intelligible Isar proofs from machine-generated proofs ⋮ Formalizing an analytic proof of the prime number theorem ⋮ Computer Certification of Generalized Rough Sets Based on Relations ⋮ Checking Proofs ⋮ Eliciting implicit assumptions of Mizar proofs by property omission ⋮ On rewriting rules in Mizar ⋮ Optimizing proof search in model elimination ⋮ Flexary connectives in Mizar ⋮ Semantics of Mizar as an Isabelle object logic ⋮ A Vernacular for Coherent Logic ⋮ Premise selection for mathematics by corpus analysis and kernel methods



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