Set theory in first-order logic: Clauses for Gödel's axioms (Q1097252): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114264489, #quickstatements; #temporary_batch_1706364719135 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:29, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Set theory in first-order logic: Clauses for Gödel's axioms |
scientific article |
Statements
Set theory in first-order logic: Clauses for Gödel's axioms (English)
0 references
1986
0 references
In this paper we present a set of clauses for set theory, thus developing a foundation for the expression of most theorems of mathematics in a form acceptable to a resolution-based automated theorem prover. Because Gödel's formulation of set theory permits presentation in a finite number of first-order formulas, we employ it rather than that of Zermelo- Fraenkel. We illustrate the expressive power of this formulation by providing statements of some well-known open questions in number theory, and give some intuition about how the axioms are used by including some sample proofs. A small set of challenge problems is also given.
0 references
resolution-based automated theorem proving
0 references
set of clauses for set theory
0 references
Gödel's formulation of set theory
0 references
number theory
0 references