A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä

From infinite to finite by identifying variables in many-valued logic




TekijätSalomaa Arto

KustantajaInstitut fur Informatik, Justus-Liebig-Universitat Giessen

Julkaisuvuosi2018

JournalJournal of Automata, Languages and Combinatorics

Tietokannassa oleva lehden nimiJournal of Automata, Languages and Combinatorics

Vuosikerta23

Aloitussivu293

Lopetussivu301


Tiivistelmä

The paper investigates compositions of many-valued truth-functions. There are specific n-valued truth-functions f, customarily referred to as Sheffer functions such that any n-valued truth-function of an arbitrary number of variables can be expressed as a composition of f. Moreover, there are infinitely many bases for the set of all n-valued truth-functions. However, the number of bases is finite if attention is restricted to bases where no variable identification is possible.



Last updated on 2024-26-11 at 14:12