Displaying 21 – 40 of 68

Showing per page

BL-algebras of basic fuzzy logic.

Esko Turunen (1999)

Mathware and Soft Computing

BL-algebras [Hajek] rise as Lindenbaum algebras from certain logical axioms familiar in fuzzy logic framework. BL-algebras are studied by means of deductive systems and co-annihilators. Duals of many theorems known to hold in MV-algebra theory remain valid for BL-algebras, too.

Bohr compactifications of discrete structures

Joan Hart, Kenneth Kunen (1999)

Fundamenta Mathematicae

We prove the following theorem: Given a⊆ω and 1 α < ω 1 C K , if for some η < 1 and all u ∈ WO of length η, a is Σ α 0 ( u ) , then a is Σ α 0 .We use this result to give a new, forcing-free, proof of Leo Harrington’s theorem: Σ 1 1 -Turing-determinacy implies the existence of 0 .

Currently displaying 21 – 40 of 68