In metalogic and metamathematics, Frege's theorem is a metatheorem that states that the Peano axioms of arithmetic can be derived in second-order logic...
7 KB (678 words) - 00:20, 14 October 2024
ongoing rehabilitation of Frege's logicism. Boolos, George, 1998. Logic, Logic, and Logic. MIT Press. — 12 papers on Frege's theorem and the logicist approach...
47 KB (5,288 words) - 09:07, 22 November 2024
known as Frege's theorem, which is the foundation for a philosophy of mathematics known as neo-logicism. Hume's principle appears in Frege's Foundations...
7 KB (769 words) - 12:23, 30 November 2023
philosopher Gottlob Frege. Boolos proved a conjecture due to Crispin Wright (and also proved, independently, by others), that the system of Frege's Grundgesetze...
19 KB (2,176 words) - 06:47, 16 November 2024
The Foundations of Arithmetic (redirect from Frege's Foundations of Arithmetic)
motivate Frege's later works in logicism. The book was also seminal in the philosophy of language. Michael Dummett traces the linguistic turn to Frege's Grundlagen...
15 KB (1,991 words) - 18:13, 27 October 2024
Gödel's incompleteness theorems are two theorems of mathematical logic that are concerned with the limits of provability in formal axiomatic theories...
92 KB (12,121 words) - 18:52, 8 November 2024
In mathematical logic, the Löwenheim–Skolem theorem is a theorem on the existence and cardinality of models, named after Leopold Löwenheim and Thoralf...
22 KB (2,795 words) - 12:03, 4 October 2024
centuries saw the development of modern logic and formalized mathematics. Frege's Begriffsschrift (1879) introduced both a complete propositional calculus...
29 KB (2,945 words) - 12:39, 20 November 2024
Foundations of mathematics Frege's theorem Goodstein's theorem Neo-logicism Non-standard model of arithmetic Paris–Harrington theorem Presburger arithmetic...
48 KB (6,428 words) - 23:25, 3 November 2024
Dedekind–Peano axioms. Both results were proven informally by Gottlob Frege (Frege's Theorem), and would later be more rigorously proven by George Boolos and...
15 KB (1,232 words) - 12:56, 10 November 2024
a specific value assigned to it within the context of the formula. Frege's theorem A result in logic and mathematics demonstrating that arithmetic can...
270 KB (30,189 words) - 07:45, 24 November 2024
Press Freedom versus license Freethought Frege's Puzzle Frege's theorem Frege-Geach point Frege-Geach problem Frege–Church ontology Freie Arbeiter Stimme...
73 KB (7,034 words) - 20:17, 4 November 2024
question marks, boxes, or other symbols. In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any set A {\displaystyle...
22 KB (3,734 words) - 15:58, 24 October 2024
X. Frege's propositional calculus is not a Frege system, since it used axioms instead of axiom schemes, although it can be modified to be a Frege system...
7 KB (912 words) - 06:05, 14 October 2024
strongly recommended to examine Frege's argument on the point" (Russell 1903:522); The abbreviation Gg. stands for Frege's Grundgezetze der Arithmetik. Begriffsschriftlich...
31 KB (4,605 words) - 09:54, 18 November 2024
Begriffsschrift (category Books by Gottlob Frege)
of Frege's Begriffsschrift," Historia Mathematica 25(4): 412–422. Wikimedia Commons has media related to Begriffsschrift. Zalta, Edward N. "Frege's Logic...
12 KB (1,372 words) - 03:18, 20 October 2024
paradox in 1901 by Bertrand Russell. This proved Frege's naive set theory led to a contradiction. Frege's theory contained the axiom that for any formal...
102 KB (13,265 words) - 23:10, 16 September 2024
Consequentia mirabilis (category Theorems in propositional logic)
which lacks both excluded middle and the principle of explosion. Frege's theorem states ( B → ( C → D ) ) → ( ( B → C ) → ( B → D ) ) {\displaystyle...
7 KB (1,102 words) - 20:53, 20 November 2024
term. Frege reduced properties and relations to functions and so these entities are not included among the objects. Some authors make use of Frege’s notion...
26 KB (2,538 words) - 18:34, 12 November 2024
the Entscheidungsproblem ("decision problem"), the Frege–Church ontology, and the Church–Rosser theorem. Alongside his doctoral student Alan Turing, Church...
24 KB (2,214 words) - 05:17, 5 November 2024
"a formula language, modeled on that of arithmetic, of pure thought." Frege's motivation for developing his formal approach to logic resembled Leibniz's...
13 KB (1,666 words) - 08:01, 8 October 2024
foundational systems, including ZFC and category theory, and from the system of Frege's Grundgesetze der Arithmetik using modern notation and natural deduction...
6 KB (768 words) - 01:35, 20 November 2024
Kurt Gödel (section Incompleteness theorems)
by Frege, Richard Dedekind, and Georg Cantor. Gödel's discoveries in the foundations of mathematics led to the proof of his completeness theorem in 1929...
49 KB (5,484 words) - 15:16, 21 November 2024
combination of Frege's Urteilsstrich, judgement stroke [ | ], and Inhaltsstrich, content stroke [—], came to be called the assertion sign." Frege's notation...
10 KB (1,229 words) - 03:34, 29 August 2024
Hilbert system (category Automated theorem proving)
thereby qualifies as a Hilbert system dates back to Gottlob Frege's 1879 Begriffsschrift. Frege's system used only implication and negation as connectives...
28 KB (3,623 words) - 14:15, 17 November 2024
Frege (1960) dismissed Schröder's work, and admiration for Frege's pioneering role has dominated subsequent historical discussion. Contrasting Frege with...
12 KB (1,460 words) - 14:01, 15 March 2024
article gives a sketch of a proof of Gödel's first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses...
22 KB (2,996 words) - 20:27, 2 September 2024
Consistency (redirect from Henkin's theorem)
incompleteness theorems show that any sufficiently strong recursively enumerable theory of arithmetic cannot be both complete and consistent. Gödel's theorem applies...
20 KB (2,914 words) - 18:16, 31 August 2024
Mathematical proof (redirect from Theorem-proving)
The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic...
38 KB (4,778 words) - 08:10, 24 September 2024
to analysis in proof theory, such as the Löwenheim–Skolem theorem and the compactness theorem. First-order logic is the standard for the formalization...
93 KB (13,146 words) - 17:35, 25 November 2024