Criterion for propositional calculi to be finitely generated
-
G. V. Bokov
Abstract
The paper is concerned with propositional calculi having arbitrary modus inference operations that are analogous to the modus ponens operation. For these calculi the question on the existence and cardinality of sets of generators is examined. A criterion for propositional calculi with arbitrary modus inference operations to be finitely generated is put forward. For some calculi, the existence of a finite complete system of tautologies is shown to imply the existence of a basis of arbitrarily large finite cardinality. We show the existence of propositional calculi with countable basis, without any basis, and calculi having a complete subsystem without any basis.
© 2014 by Walter de Gruyter Berlin/Boston
Artikel in diesem Heft
- Front matter
- Criterion for propositional calculi to be finitely generated
- Fast Catalan constant computation via the approximations obtained by the Kummer’s type transformations
- Cycle indices of an automaton
- Definability in the language of functional equations of a countable-valued logic
- On bigram languages
- The diagnosis of states of contacts
- Finite systems of generators of infinite subgroups of the Golod group
- On the number of cyclic points of random A-mapping
Artikel in diesem Heft
- Front matter
- Criterion for propositional calculi to be finitely generated
- Fast Catalan constant computation via the approximations obtained by the Kummer’s type transformations
- Cycle indices of an automaton
- Definability in the language of functional equations of a countable-valued logic
- On bigram languages
- The diagnosis of states of contacts
- Finite systems of generators of infinite subgroups of the Golod group
- On the number of cyclic points of random A-mapping