Name
Abstract | ||
|---|---|---|
The language for the formulation of the interesting statements is, of course, most important. We use first order predicate
logic. Our main achievement in this paper is an axiom system which we believe to be more powerful than any other natural general
purpose discovery axiom system.
We prove soundness of this axiom system in this paper. Additionally we prove that if we remove some of the requirements used
in our axiom system, the system becomes not sound. We characterize the complexity of the quantifier prefix which guaranties
provability of a true formula via our system. We prove also that if a true formula contains only monadic predicates, our axiom
system is capable to prove this formula in the considered model.
|
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-44669-9_1 | Fundamentals of Computation Theory |
Keywords | Field | DocType |
natural general purpose discovery,towards axiomatic basis,true formula,considered model,interesting statement,inductive inference,main achievement,order predicate logic,axiom system,quantifier prefix,monadic predicate,first order | Axiom schema,Axiom of choice,Discrete mathematics,Action axiom,Zermelo–Fraenkel set theory,Computer science,Urelement,Non-well-founded set theory,Constructive set theory,Axiom of extensionality | Conference |
ISBN | Citations | PageRank |
3-540-42487-3 | 0 | 0.34 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janis Barzdins | 1 | 199 | 35.69 |
| Rusins Freivalds | 2 | 781 | 90.68 |
| Carl H. Smith | 3 | 664 | 493.76 |