|
|
|
|
|
|
by LegionMammal978
654 days ago
|
|
|
Nothing in particular, sorry. The closest would be the idea of a recursively axiomatizable theory in mathematics, which is one that can be fully evaluated, enumerated, etc. using a finite algorithm. Usually, such a theory is presented as a finite list of axioms and axiom schemata: a theory that is not recursively axiomatizable could not be presented in such a simple way. |
|
|