DECISION PROBLEMS AND RECURSIVENESS IN FORMAL LOGIC SYSTEMS
The recursion theory states that a decision problem is recursively solvable if there is a mechanical process to solve it. Within the context of formal logic, the decision problem consist to determine whether any wellformed formula of the system is a theorem or not. This paper first discusses, among...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad de Costa Rica
2017-04-01
|
| Series: | Revista de Matemática: Teoría y Aplicaciones |
| Subjects: | |
| Online Access: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/22338 |