Startseite Criterion for propositional calculi to be finitely generated
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Criterion for propositional calculi to be finitely generated

  • G. V. Bokov
Veröffentlicht/Copyright: 1. Mai 2014
Veröffentlichen auch Sie bei De Gruyter Brill

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.

Keywords : Keywords
Published Online: 2014-5-1
Published in Print: 2013-12-1

© 2014 by Walter de Gruyter Berlin/Boston

Heruntergeladen am 30.11.2025 von https://www.degruyterbrill.com/document/doi/10.1515/dma-2013-0028/html?lang=de
Button zum nach oben scrollen