Misplaced Pages

In logic, more specifically proof theory, a Hilbert system, sometimes called Hilbert calculus, Hilbert-style system, Hilbert-style proof system, Hilbert-style deductive system or Hilbert–Ackermann system, is a type of formal proof system attributed to Gottlob Frege and David Hilbert. These deductive systems are most often studied for first-order logic, but are of interest for other logics as well.

It is defined as a deductive system that generates theorems from axioms and inference rules, especially if the only inference rule is modus ponens. Every Hilbert system is an axiomatic system, which is used by many authors as a sole less specific term to declare their Hilbert systems, without mentioning any more specific terms. In this context, "Hilbert systems" are contrasted with natural deduction systems, in which no axioms are used, only inference rules.

While all sources that refer to an "axiomatic" logical proof system characterize it simply as a logical proof system with axioms, sources that use variants of the term "Hilbert system" sometimes define it in different ways, which will not be used in this article. For instance, Troelstra defines a "Hilbert system" as a system with axioms and with ${\displaystyle {\rightarrow }E}$ and ${\displaystyle {\forall }I}$ as the only inference rules. A specific set of axioms is also sometimes called "the Hilbert system", or "the Hilbert-style calculus". Sometimes, "Hilbert-style" is used to convey the type of axiomatic system that has its axioms given in schematic form, as in the § Schematic form of P2 below—but other sources use the term "Hilbert-style" as encompassing both systems with schematic axioms and systems with a rule of substitution, as this article does. The use of "Hilbert-style" and similar terms to describe axiomatic proof systems in logic is due to the influence of Hilbert and Ackermann's Principles of Mathematical Logic (1928).

Most variants of Hilbert systems take a characteristic tack in the way they balance a trade-off between logical axioms and rules of inference. Hilbert systems can be characterised by the choice of a large number of schemas of logical axioms and a small set of rules of inference. Systems of natural deduction take the opposite tack, including many deduction rules but very few or no axiom schemas. The most commonly studied Hilbert systems have either just one rule of inference – modus ponens, for propositional logics – or two – with generalisation, to handle predicate logics, as well – and several infinite axiom schemas. Hilbert systems for alethic modal logics, sometimes called Hilbert-Lewis systems, additionally require the necessitation rule. Some systems use a finite list of concrete formulas as axioms instead of an infinite set of formulas via axiom schemas, in which case the uniform substitution rule is required.

A characteristic feature of the many variants of Hilbert systems is that the context is not changed in any of their rules of inference, while both natural deduction and sequent calculus contain some context-changing rules. Thus, if one is interested only in the derivability of tautologies, no hypothetical judgments, then one can formalize the Hilbert system in such a way that its rules of inference contain only judgments of a rather simple form. The same cannot be done with the other two deductions systems: as context is changed in some of their rules of inferences, they cannot be formalized so that hypothetical judgments could be avoided – not even if we want to use them just for proving derivability of tautologies.

Formal deductions

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (August 2024) (Learn how and when to remove this message)

In a Hilbert system, a formal deduction (or proof) is a finite sequence of formulas in which each formula is either an axiom or is obtained from previous formulas by a rule of inference. These formal deductions are meant to mirror natural-language proofs, although they are far more detailed.

Suppose ${\displaystyle \Gamma }$ is a set of formulas, considered as hypotheses. For example, ${\displaystyle \Gamma }$ could be a set of axioms for group theory or set theory. The notation ${\displaystyle \Gamma \vdash \phi }$ means that there is a deduction that ends with ${\displaystyle \phi }$ using as axioms only logical axioms and elements of ${\displaystyle \Gamma }$. Thus, informally, ${\displaystyle \Gamma \vdash \phi }$ means that ${\displaystyle \phi }$ is provable assuming all the formulas in ${\displaystyle \Gamma }$.

Hilbert systems are characterized by the use of numerous schemas of logical axioms. An axiom schema is an infinite set of axioms obtained by substituting all formulas of some form into a specific pattern. The set of logical axioms includes not only those axioms generated from this pattern, but also any generalization of one of those axioms. A generalization of a formula is obtained by prefixing zero or more universal quantifiers on the formula; for example ${\displaystyle \forall y(\forall xPxy\to Pty)}$ is a generalization of ${\displaystyle \forall xPxy\to Pty}$.

Propositional logic

The following are some Hilbert systems that have been used in propositional logic. One of them, the § Schematic form of P2, is also considered a Frege system.

Frege's Begriffsschrift

Axiomatic proofs have been used in mathematics since the famous Ancient Greek textbook, Euclid's Elements of Geometry, c. 300 BC. But the first known fully formalized proof system that thereby qualifies as a Hilbert system dates back to Gottlob Frege's 1879 Begriffsschrift. Frege's system used only implication and negation as connectives, and it had six axioms, which were these ones:

• Proposition 1: ${\displaystyle a\supset (b\supset a)}$
• Proposition 2: ${\displaystyle (c\supset (b\supset a))\supset ((c\supset b)\supset (c\supset a))}$
• Proposition 8: ${\displaystyle (d\supset (b\supset a))\supset (b\supset (d\supset a))}$
• Proposition 28: ${\displaystyle (b\supset a)\supset (\neg a\supset \neg b)}$
• Proposition 31: ${\displaystyle \neg \neg a\supset a}$
• Proposition 41: ${\displaystyle a\supset \neg \neg a}$

These were used by Frege together with modus ponens and a rule of substitution (which was used but never precisely stated) to yield a complete and consistent axiomatization of classical truth-functional propositional logic.

Łukasiewicz's P₂

Jan Łukasiewicz showed that, in Frege's system, "the third axiom is superfluous since it can be derived from the preceding two axioms, and that the last three axioms can be replaced by the single sentence ${\displaystyle CCNpNqCqp}$". Which, taken out of Łukasiewicz's Polish notation into modern notation, means ${\displaystyle (\neg p\rightarrow \neg q)\rightarrow (q\rightarrow p)}$. Hence, Łukasiewicz is credited with this system of three axioms:

• ${\displaystyle p\to (q\to p)}$
• ${\displaystyle (p\to (q\to r))\to ((p\to q)\to (p\to r))}$
• ${\displaystyle (\neg p\to \neg q)\to (q\to p)}$

Just like Frege's system, this system uses a substitution rule and uses modus ponens as an inference rule. The exact same system was given (with an explicit substitution rule) by Alonzo Church, who referred to it as the system P_2, and helped popularize it.

Schematic form of P₂

One may avoid using the rule of substitution by giving the axioms in schematic form, using them to generate an infinite set of axioms. Hence, using Greek letters to represent schemas (metalogical variables that may stand for any well-formed formulas), the axioms are given as:

• ${\displaystyle \varphi \to (\psi \to \varphi )}$
• ${\displaystyle (\varphi \to (\psi \to \chi ))\to ((\varphi \to \psi )\to (\varphi \to \chi ))}$
• ${\displaystyle (\neg \varphi \to \neg \psi )\to (\psi \to \varphi )}$

The schematic version of P₂ is attributed to John von Neumann, and is used in the Metamath "set.mm" formal proof database. In fact, the very idea of using axiom schemas to replace the rule of substitution is attributed to von Neumann. The schematic version of P₂ has also been attributed to Hilbert, and named ${\displaystyle {\mathcal {H}}}$ in this context.

Systems for propositional logic whose inference rules are schematic are also called Frege systems; as the authors that originally defined the term "Frege system" note, this actually excludes Frege's own system, given above, since it had axioms instead of axiom schemas.

Proof example in P₂

As an example, a proof of ${\displaystyle A\to A}$ in P₂ is given below. First, the axioms are given names:

(A1) ${\displaystyle (p\to (q\to p))}$

(A2) ${\displaystyle ((p\to (q\to r))\to ((p\to q)\to (p\to r)))}$

(A3) ${\displaystyle ((\neg p\to \neg q)\to (q\to p))}$

And the proof is as follows:

1. ${\displaystyle A\to ((B\to A)\to A)}$       (instance of (A1))
2. ${\displaystyle (A\to ((B\to A)\to A))\to ((A\to (B\to A))\to (A\to A))}$       (instance of (A2))
3. ${\displaystyle (A\to (B\to A))\to (A\to A)}$       (from (1) and (2) by modus ponens)
4. ${\displaystyle A\to (B\to A)}$       (instance of (A1))
5. ${\displaystyle A\to A}$       (from (4) and (3) by modus ponens)

Predicate logic (example system)

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (August 2024) (Learn how and when to remove this message)

There is an unlimited amount of axiomatisations of predicate logic, since for any logic there is freedom in choosing axioms and rules that characterise that logic. We describe here a Hilbert system with nine axioms and just the rule modus ponens, which we call the one-rule axiomatisation and which describes classical equational logic. We deal with a minimal language for this logic, where formulas use only the connectives ${\displaystyle \lnot }$ and ${\displaystyle \to }$ and only the quantifier ${\displaystyle \forall }$. Later we show how the system can be extended to include additional logical connectives, such as ${\displaystyle \land }$ and ${\displaystyle \lor }$, without enlarging the class of deducible formulas.

The first four logical axiom schemas allow (together with modus ponens) for the manipulation of logical connectives.

P1. ${\displaystyle \phi \to \phi }$

P2. ${\displaystyle \phi \to \left(\psi \to \phi \right)}$

P3. ${\displaystyle \left(\phi \to \left(\psi \rightarrow \xi \right)\right)\to \left(\left(\phi \to \psi \right)\to \left(\phi \to \xi \right)\right)}$

P4. ${\displaystyle \left(\lnot \phi \to \lnot \psi \right)\to \left(\psi \to \phi \right)}$

The axiom P1 is redundant, as it follows from P3, P2 and modus ponens (see proof). These axioms describe classical propositional logic; without axiom P4 we get positive implicational logic. Minimal logic is achieved either by adding instead the axiom P4m, or by defining ${\displaystyle \lnot \phi }$ as ${\displaystyle \phi \to \bot }$.

P4m. ${\displaystyle \left(\phi \to \psi \right)\to \left(\left(\phi \to \lnot \psi \right)\to \lnot \phi \right)}$

Intuitionistic logic is achieved by adding axioms P4i and P5i to positive implicational logic, or by adding axiom P5i to minimal logic. Both P4i and P5i are theorems of classical propositional logic.

P4i. ${\displaystyle \left(\phi \to \lnot \phi \right)\to \lnot \phi }$

P5i. ${\displaystyle \lnot \phi \to \left(\phi \to \psi \right)}$

Note that these are axiom schemas, which represent infinitely many specific instances of axioms. For example, P1 might represent the particular axiom instance ${\displaystyle p\to p}$, or it might represent ${\displaystyle \left(p\to q\right)\to \left(p\to q\right)}$: the ${\displaystyle \phi }$ is a place where any formula can be placed. A variable such as this that ranges over formulae is called a 'schematic variable'.

With a second rule of uniform substitution (US), we can change each of these axiom schemas into a single axiom, replacing each schematic variable by some propositional variable that isn't mentioned in any axiom to get what we call the substitutional axiomatisation. Both formalisations have variables, but where the one-rule axiomatisation has schematic variables that are outside the logic's language, the substitutional axiomatisation uses propositional variables that do the same work by expressing the idea of a variable ranging over formulae with a rule that uses substitution.

US. Let ${\displaystyle \phi (p)}$ be a formula with one or more instances of the propositional variable ${\displaystyle p}$, and let ${\displaystyle \psi }$ be another formula. Then from ${\displaystyle \phi (p)}$, infer ${\displaystyle \phi (\psi )}$.

The next three logical axiom schemas provide ways to add, manipulate, and remove universal quantifiers.

Q5. ${\displaystyle \forall x\left(\phi \right)\to \phi }$ where t may be substituted for x in ${\displaystyle \,\!\phi }$

Q6. ${\displaystyle \forall x\left(\phi \to \psi \right)\to \left(\forall x\left(\phi \right)\to \forall x\left(\psi \right)\right)}$

Q7. ${\displaystyle \phi \to \forall x\left(\phi \right)}$ where x is not free in ${\displaystyle \phi }$.

These three additional rules extend the propositional system to axiomatise classical predicate logic. Likewise, these three rules extend system for intuitionstic propositional logic (with P1-3 and P4i and P5i) to intuitionistic predicate logic.

Universal quantification is often given an alternative axiomatisation using an extra rule of generalisation (see the section on Metatheorems), in which case the rules Q6 and Q7 are redundant.

The final axiom schemas are required to work with formulas involving the equality symbol.

I8. ${\displaystyle x=x}$ for every variable x.

I9. ${\displaystyle \left(x=y\right)\to \left(\phi \to \phi \right)}$

Conservative extensions

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (March 2024) (Learn how and when to remove this message)

It is common to include in a Hilbert system only axioms for the logical operators implication and negation towards functional completeness. Given these axioms, it is possible to form conservative extensions of the deduction theorem that permit the use of additional connectives. These extensions are called conservative because if a formula φ involving new connectives is rewritten as a logically equivalent formula θ involving only negation, implication, and universal quantification, then φ is derivable in the extended system if and only if θ is derivable in the original system. When fully extended, a Hilbert system will resemble more closely a system of natural deduction.

Existential quantification

• Introduction

${\displaystyle \forall x(\phi \to \exists y(\phi ))}$

• Elimination

${\displaystyle \forall x(\phi \to \psi )\to \exists x(\phi )\to \psi }$ where ${\displaystyle x}$ is not a free variable of ${\displaystyle \psi }$.

Conjunction and disjunction

• Conjunction introduction and elimination

introduction: ${\displaystyle \alpha \to (\beta \to \alpha \land \beta )}$

elimination left: ${\displaystyle \alpha \wedge \beta \to \alpha }$

elimination right: ${\displaystyle \alpha \wedge \beta \to \beta }$

• Disjunction introduction and elimination

introduction left: ${\displaystyle \alpha \to \alpha \vee \beta }$

introduction right: ${\displaystyle \beta \to \alpha \vee \beta }$

elimination: ${\displaystyle (\alpha \to \gamma )\to ((\beta \to \gamma )\to \alpha \vee \beta \to \gamma )}$

Metatheorems

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (March 2024) (Learn how and when to remove this message)

Because Hilbert systems have very few deduction rules, it is common to prove metatheorems that show that additional deduction rules add no deductive power, in the sense that a deduction using the new deduction rules can be converted into a deduction using only the original deduction rules.

See also

• List of Hilbert systems
• Natural deduction
• Sequent calculus

Notes

1. ^ Máté & Ruzsa 1997:129
2. ^ Smith, Peter (2013-02-21). An Introduction to Gödel's Theorems. Cambridge University Press. p. 10. ISBN 978-1-107-02284-3.
3. ^ Restall, Greg (2002-09-11). An Introduction to Substructural Logics. Routledge. pp. 73–74. ISBN 978-1-135-11131-1.
4. Gaifman, Haim (2002). "A Hilbert Type Deductive System for Sentential Logic, Completeness and Compactness" (PDF). Columbia. Retrieved 2024-08-19.
5. Benthem, Johan van; Gupta, Amitabha; Parikh, Rohit (2011-04-02). Proof, Computation and Agency: Logic at the Crossroads. Springer Science & Business Media. p. 41. ISBN 978-94-007-0080-2.
6. Bacon, Andrew (2023-09-29). A Philosophical Introduction to Higher-order Logics. Taylor & Francis. p. 424. ISBN 978-1-000-92575-3.
7. Eijck, Jan van (1991-02-26). Logics in AI: European Workshop JELIA '90, Amsterdam, The Netherlands, September 10-14, 1990. Proceedings. Springer Science & Business Media. p. 113. ISBN 978-3-540-53686-4.
8. Haack, Susan (1978-07-27). Philosophy of Logics. Cambridge University Press. p. 19. ISBN 978-0-521-29329-7.
9. ^ Bostock, David (1997). Intermediate logic. Oxford : New York: Clarendon Press; Oxford University Press. pp. 4–5, 8–13, 18–19, 22, 27, 29, 191, 194. ISBN 978-0-19-875141-0.
10. Lucas, J. R. (2018-10-10). A Treatise on Time and Space. Routledge. p. 152. ISBN 978-0-429-68517-0.
11. Troelstra, A. S.; Schwichtenberg, H. (2000). Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science (2 ed.). Cambridge: Cambridge University Press. p. 51. doi:10.1017/cbo9781139168717. ISBN 978-0-521-77911-1.
12. "Introduction to Logic - Chapter 4". intrologic.stanford.edu. Retrieved 2024-08-16.
13. Buss, S. R. (1998-07-09). Handbook of Proof Theory. Elsevier. pp. 552–553. ISBN 978-0-08-053318-6.
14. Ono, Hiroakira (2019-08-02). Proof Theory and Algebra in Logic. Springer. p. 5. ISBN 978-981-13-7997-0.
15. Bacon, Andrew (2023-09-29). A Philosophical Introduction to Higher-order Logics. Taylor & Francis. p. 424. ISBN 978-1-000-92575-3.
16. Eijck, Jan van (1991-02-26). Logics in AI: European Workshop JELIA '90, Amsterdam, The Netherlands, September 10-14, 1990. Proceedings. Springer Science & Business Media. p. 113. ISBN 978-3-540-53686-4.
17. Troelstra, A. S.; Schwichtenberg, H. (2000). Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science (2 ed.). Cambridge: Cambridge University Press. p. 51. doi:10.1017/cbo9781139168717. ISBN 978-0-521-77911-1.
18. Ono, Hiroakira (2019-08-02). Proof Theory and Algebra in Logic. Springer. p. 5. ISBN 978-981-13-7997-0.
19. Gabbay, Dov M.; Guenthner, Franz (2013-03-14). Handbook of Philosophical Logic. Springer Science & Business Media. p. 201. ISBN 978-94-017-0458-8.
20. ^ Smullyan, Raymond M. (2014-07-23). A Beginner's Guide to Mathematical Logic. Courier Corporation. pp. 102–103. ISBN 978-0-486-49237-7.
21. Franks, Curtis (2023), "Propositional Logic", in Zalta, Edward N.; Nodelman, Uri (eds.), The Stanford Encyclopedia of Philosophy (Fall 2023 ed.), Metaphysics Research Lab, Stanford University, retrieved 2024-03-22
22. ^ Mendelsohn, Richard L. (2005-01-10). The Philosophy of Gottlob Frege. Cambridge University Press. p. 185. ISBN 978-1-139-44403-3.
23. ^ Łukasiewicz, Jan (1970). Jan Lukasiewicz: Selected Works. North-Holland. p. 136.
24. ^ Church, Alonzo (1996). Introduction to Mathematical Logic. Princeton University Press. p. 119. ISBN 978-0-691-02906-1.
25. ^ "Proof Explorer - Home Page - Metamath". us.metamath.org. Retrieved 2024-07-02.
26. ^ Cook, Stephen A.; Reckhow, Robert A. (1979). "The relative efficiency of propositional proof systems". The Journal of Symbolic Logic. 44 (1): 39. doi:10.2307/2273702. ISSN 0022-4812. JSTOR 2273702.
27. Walicki, Michał (2017). Introduction to mathematical logic (Extended ed.). New Jersey: World Scientific. p. 126. ISBN 978-981-4719-95-7.
28. Pudlák, Pavel; Buss, Samuel R. (1995). "How to lie without being (easily) convicted and the lengths of proofs in propositional calculus". In Pacholski, Leszek; Tiuryn, Jerzy (eds.). Computer Science Logic. Lecture Notes in Computer Science. Vol. 933. Berlin, Heidelberg: Springer. p. 152. doi:10.1007/BFb0022253. ISBN 978-3-540-49404-1.

References

• Curry, Haskell B.; Robert Feys (1958). Combinatory Logic Vol. I. Vol. 1. Amsterdam: North Holland.
• Monk, J. Donald (1976). Mathematical Logic. Graduate Texts in Mathematics. Berlin, New York: Springer-Verlag. ISBN 978-0-387-90170-1.
• Ruzsa, Imre; Máté, András (1997). Bevezetés a modern logikába (in Hungarian). Budapest: Osiris Kiadó.
• Tarski, Alfred (1990). Bizonyítás és igazság (in Hungarian). Budapest: Gondolat. It is a Hungarian translation of Alfred Tarski's selected papers on semantic theory of truth.
• David Hilbert (1927) "The foundations of mathematics", translated by Stephan Bauer-Menglerberg and Dagfinn Føllesdal (pp. 464–479). in:
  • van Heijenoort, Jean (1967). From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931 (3rd printing 1976 ed.). Cambridge MA: Harvard University Press. ISBN 0-674-32449-8.
  • Hilbert's 1927, Based on an earlier 1925 "foundations" lecture (pp. 367–392), presents his 17 axioms—axioms of implication #1-4, axioms about & and V #5-10, axioms of negation #11-12, his logical ε-axiom #13, axioms of equality #14-15, and axioms of number #16-17—along with the other necessary elements of his Formalist "proof theory"—e.g. induction axioms, recursion axioms, etc; he also offers up a spirited defense against L.E.J. Brouwer's Intuitionism. Also see Hermann Weyl's (1927) comments and rebuttal (pp. 480–484), Paul Bernay's (1927) appendix to Hilbert's lecture (pp. 485–489) and Luitzen Egbertus Jan Brouwer's (1927) response (pp. 490–495)
• Kleene, Stephen Cole (1952). Introduction to Metamathematics (10th impression with 1971 corrections ed.). Amsterdam NY: North Holland Publishing Company. ISBN 0-7204-2103-9.
  • See in particular Chapter IV Formal System (pp. 69–85) wherein Kleene presents subchapters §16 Formal symbols, §17 Formation rules, §18 Free and bound variables (including substitution), §19 Transformation rules (e.g. modus ponens) -- and from these he presents 21 "postulates"—18 axioms and 3 "immediate-consequence" relations divided as follows: Postulates for the propostional calculus #1-8, Additional postulates for the predicate calculus #9-12, and Additional postulates for number theory #13-21.

External links

• Gaifman, Haim. "A Hilbert Type Deductive System for Sentential Logic, Completeness and Compactness" (PDF).
• Farmer, W. M. "Propositional logic" (PDF). It describes (among others) a specific Hilbert-style proof system (that is restricted to propositional calculus).

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

• Proof theory
• Logical calculi
• Automated theorem proving