Abstract. In this paper the concept of asymptotic complexity of languages is introduced. This concept formalises the notion of learnability in a particular environment and generali...
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
The standard approach to information entropy applied to partitions of a universe is equivalently formulated as the entropy of the corresponding crisp identity resolutions, interpre...
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...
Abstract. We introduce an implication-with-possible-exceptions and define validity of rules-withpossible-exceptions by means of the topological notion of a full subset. Our implica...