ScholarLens Back to search
2016•Yugoslav journal of operations researchOpen access

A note on entropy of logic

Marija Boričić

Open full text 1 citations

Abstract

We propose an entropy based classification of propositional calculi. Our method can be applied to finite?valued propositional logics and then, extended asymptotically to infinite?valued logics. In this paper we consider a classification depending on the number of truth values of a logic and not on the number of its designated values. Furthermore, we believe that almost the same approach can be useful in classification of finite algebras.

Open-access reader

About this research paper

What this paper is about

We propose an entropy based classification of propositional calculi. Our method can be applied to finite?valued propositional logics and then, extended asymptotically to infinite?valued logics. In this paper we consider a classification depending on the number of truth values of a logic and not on the number of its designated values. Furthermore, we believe that almost the same approach can be useful in classification of finite algebras.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We propose an entropy based classification of propositional calculi. Our method can be applied to finite?valued propositional logics and then, extended asymptotically to infinite?valued logics. In this paper we consider a classification depending on the number of truth values of a logic and not on the number of its designated values. Furthermore, we believe that almost the same approach can be useful in classification of finite algebras.

Key concepts: Mathematics, Propositional calculus, Propositional variable, Truth function, Discrete mathematics, Truth value, Well-formed formula, Entropy (arrow of time)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A note on entropy of logic — Research Paper | ScholarLens