Many-valued computational logics
Copyright policy )Many-valued computational logics
This paper deals with the problem of decidability of propositional logics defined by finite generalized matrices. The notions of computational logic and of computational semantics are introduced and it is shown that for finitely-valued logics, the class of computational calculi coincides with the class of logics with computational semantics. Moreover, the uniform truth-table theoremhood verification method (uttm) is defined and the class of computational logics with uttm is characterized.
- University of York United Kingdom
- York College United States
Decidability of theories and sets of sentences, computational logic, uniform truth-table theoremhood verification method, Many-valued logic, computational semantics, decidability of propositional logics defined by finite generalized matrices, finitely-valued logics
Decidability of theories and sets of sentences, computational logic, uniform truth-table theoremhood verification method, Many-valued logic, computational semantics, decidability of propositional logics defined by finite generalized matrices, finitely-valued logics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!