Algebras of Intervals and a Logic of Conditional Assertions

Intervals in boolean algebras enter into the study of conditional assertions (or events) in two ways: directly, either from intuitive arguments or from Goodman, Nguyen and Walker's representation theorem, as suitable mathematical entities to bear conditional probabilities, or indirectly, via a representation theorem for the family of algebras associated with de Finetti's three-valued logic of conditional assertions/events. Further representation theorems forge a connection with rough sets. The representation theorems and an equivalent of the boolean prime ideal theorem yield an algebraic completeness theorem for the three-valued logic. This in turn leads to a Henkin-style completeness theorem. Adequacy with respect to a family of Kripke models for de Finetti's logic, ukasiewicz's three-valued logic and Priest's Logic of Paradox is demonstrated. The extension to first-order yields a short proof of adequacy for Körner's logic of inexact predicates.     

Free Łukasiewicz and Hoop Residuation Algebras

Hoop residuation algebras are the {, 1}-subreducts of hoops; they include Hilbert algebras and the {, 1}-reducts of MV-algebras (also known as Wajsberg algebras). The paper investigates the structure and cardinality of finitely generated free algebras in varieties of k-potent hoop residuation algebras. The assumption of k-potency guarantees local finiteness of the varieties considered. It is shown that the free algebra on n generators in any of these varieties can be represented as a union of n subalgebras, each of which is a copy of the {, 1}-reduct of the same finite MV-algebra, i.e., of the same finite product of linearly ordered (simple) algebras. The cardinality of the product can be determined in principle, and an inclusion-exclusion type argument yields the cardinality of the free algebra. The methods are illustrated by applying them to various cases, both known (varieties generated by a finite linearly ordered Hilbert algebra) and new (residuation reducts of MV-algebras and of hoops).     

On Alternative Geometries,Arithmetics, and Logics; a Tribute to Łukasiewicz

The paper discusses the similarity between geometry, arithmetic, and logic, specifically with respect to the question of whether applied theories of each may be revised. It argues that they can - even when the revised logic is a paraconsistent one, or the revised arithmetic is an inconsistent one. Indeed, in the case of logic, it argues that logic is not only revisable, but, during its history, it has been revised. The paper also discusses Quine's well known argument against the possibility of logical deviancy.     

Edgar Morin: From Vicious Circles to Virtuous Circles

Morin stresses the danger of the tendency to apply the method of natural sciences to human disciplines, considering the latter a natural object, and seeking one great explicative and definitive mathematical cosmological form by means of the reduction of the anthropological aspect to the biological one, of the biological to the physical–chemical aspect and the physical to the mathematical aspect. Hence the need to find a new way of organizing knowledge based on the concept of “circularity,” which is fundamental both in Morin's thought and in the philosophy of complexity in general. We must therefore establish a circular relation among the various spheres of knowledge: physics–biology–anthropology–sociology. The classical vision of a hierarchized-mechanic world is substituted by the vision of a reticulated world.     

Future Contradictions

A common and much-explored thought is ?ukasiewicz's idea that the future is ‘indeterminate’—i.e., ‘gappy’ with respect to some claims—and that such indeterminacy bleeds back into the present in the form of gappy ‘future contingent’ claims. What is uncommon, and to my knowledge unexplored, is the dual idea of an overdeterminate future—one which is ‘glutty’ with respect to some claims. While the direct dual, with future gluts bleeding back into the present, is worth noting, my central aim is simply to sketch and briefly explore an alternative glutty-future view, one that is conservative—indeed, entirely classical—with respect to the present.

The structure of the paper runs as follows. §1 briefly sketches the target gap picture of an indeterminate future yielding gappy claims at the present. §2 presents the direct dual idea—a glut picture of an overdeterminate future yielding glutty claims at present. §3 sketches the central idea, a more interesting glut picture in which the future contains contradictory states but the present remains entirely classical. §4 contains a general defence of the idea, leaving it open as to whether the gappy-future view enjoys substantive virtues over the proposed glutty-future view of §3.     

Embedding Logics into Product Logic

We construct a faithful interpretation of ukasiewicz's logic in product logic (both propositional and predicate). Using known facts it follows that the product predicate logic is not recursively axiomatizable.We prove a completeness theorem for product logic extended by a unary connective of Baaz [1]. We show that Gödel's logic is a sublogic of this extended product logic.We also prove NP-completeness of the set of propositional formulas satisfiable in product logic (resp. in Gödel's logic).     

Implicit sequence learning in ring‐tailed lemurs (Lemur catta)

Implicit learning involves picking up information from the environment without explicit instruction or conscious awareness of the learning process. In nonhuman animals, conscious awareness is impossible to assess, so we define implicit learning as occurring when animals acquire information beyond what is required for successful task performance. While implicit learning has been documented in some nonhuman species, it has not been explored in prosimian primates. Here we ask whether ring‐tailed lemurs (Lemur catta) learn sequential information implicitly. We tested lemurs in a modified version of the serial reaction time task on a touch screen computer. Lemurs were required to respond to any picture within a 2 × 2 grid of pictures immediately after its surrounding border flickered. Over 20 training sessions, both the locations and the identities of the images remained constant and response times gradually decreased. Subsequently, the locations and/or the identities of the images were disrupted. Response times indicated that the lemurs had learned the physical location sequence required in original training but did not learn the identity of the images. Our results reveal that ring‐tailed lemurs can implicitly learn spatial sequences, and raise questions about which scenarios and evolutionary pressures give rise to perceptual versus motor‐implicit sequence learning.     

Bounded contraction and Gentzen-style formulation of Łukasiewicz logics

In this paper, we consider multiplicative-additive fragments of affine propositional classical linear logic extended with n-contraction. To be specific, n-contraction (n 2) is a version of the contraction rule where (n+ 1) occurrences of a formula may be contracted to n occurrences. We show that expansions of the linear models for (n + 1)- valued ukasiewicz logic are models for the multiplicative-additive classical linear logic, its affine version and their extensions with n-contraction. We prove the finite axiomatizability for the classes of finite models, as well as for the class of infinite linear models based on the set of rational numbers in the interval [0, 1]. The axiomatizations obtained in a Gentzen-style formulation are equivalent to finite and infinite-valued ukasiewicz logics.Presented by Jan Zygmunt