Strength (mathematical logic)
Tools
Actions
General
Print/export
In other projects
Appearance
Source: Wikipedia, the free encyclopedia.
(Redirected from Strength (mathematics))
The relative strength of two systems of formal logic can be defined via model theory. Specifically, a logic is said to be as strong as a logic
if every elementary class in
is an elementary class in
.[1]
See also
References
- ^ Heinz-Dieter Ebbinghaus Extended logics: the general framework in K. J. Barwise and S. Feferman, editors, Model-theoretic logics, 1985 ISBN 0-387-90936-2 page 43
General | |||||||||
---|---|---|---|---|---|---|---|---|---|
Theorems (list) and paradoxes | |||||||||
Logics |
| ||||||||
Set theory |
| ||||||||
Formal systems (list), language and syntax |
| ||||||||
Proof theory | |||||||||
Model theory | |||||||||
Computability theory | |||||||||
Related | |||||||||
![]() | This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |