Chagrov, A.V. and Zakharyaschev, M. (1993) The undecidability of the disjunction property of propositional logics and other related problems. The journal of Symbolic Logic 58 (3), pp. 967-1002. ISSN 0022-4812.
Abstract
‘How can we recognize, given axioms and inference rules of a calculus, whether the calculus has such-and-such property?’ A question of this kind arises whenever we deal with a new logic system. For large families of logics, this question may be considered as an algorithmic problem, and a property is called decidable in a given family if there exists an algorithm which is capable of deciding, for a finite axiomatics of a calculus in the family, whether or not it has the property.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 15 Nov 2021 13:12 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46719 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
