Transreal proof of the existence of universal possible worlds

Transreal arithmetic is total, in the sense that the fundamental operations of addition, subtraction, multiplication and division can be applied to any transreal numbers with the result being a transreal number [1]. In particular division by zero is allowed. It is proved, in [3], that transreal arithmetic is consistent and contains real arithmetic. The entire set of transreal numbers is a total semantics that models all of the semantic values, that is truth values, commonly used in logics, such as the classical, dialetheaic, fuzzy and gap values [2]. By virtue of the totality of transreal arithmetic, these logics can be implemented using total, arithmetical functions, specifically operators, whose domain and counterdomain is the entire set of transreal numbers

Transreal logical space of all propositions

Transreal numbers provide a total semantics containing classical truth values, dialetheaic, fuzzy and gap values. A paraconsistent Sheffer Stroke generalises all classical logics to a paraconsistent form. We introduce logical spaces of all possible worlds and all propositions. We operate on a proposition, in all possible worlds, at the same time. We define logical transformations, possibility and necessity relations, in proposition space, and give a criterion to determine whether a proposition is classical. We show that proofs, based on the conditional, infer gaps only from gaps and that negative and positive infinity operate as bottom and top values.

Dynamical properties of S-gap shifts and other shift spaces

We study the dynamical properties of certain shift spaces. To help study these properties we introduce two new classes of shifts, namely boundedly supermultiplicative (BSM) shifts and balanced shifts. It turns out that any almost specified shift is both BSM and balanced, and any balanced shift is BSM. However, as we will demonstrate, there are examples of shifts which are BSM but not balanced. We also study the measure theoretic properties of balanced shifts. We show that a shift space admits a Gibbs state if and only if it is balanced. Restricting ourselves to S-gap shifts, we relate certain dynamical properties of an S-gap shift to combinatorial properties from expansions in non-integer bases. This identification allows us to use the machinery from expansions in non-integer bases to give straightforward constructions of S -gap shifts with certain desirable properties. We show that for any q∈(0,1) there is an S-gap shift which has the specification property and entropy q . We also use this identification to address the question, for a given q∈(0,1), how many S-gap shifts exist with entropy q? For certain exceptional values of q there is a unique S-gap shift with this entropy.