Now showing items 1-3 of 3
Completeness of propositional logic as a program (with code)
The proof of completeness for propositional logic is a constructive one, so a computer program is suggested by the proof. We prove the completeness theorem for Łukasiewicz’ axioms directly, and translate the proof into the ...
Unicode compress: does size really matter?
The Unicode standard provides several algorithms, techniques, and strategies for assigning, transmitting, and compressing Unicode characters. These techniques allow Unicode data to be represented in a concise format in ...
Implementations of bidirectional reordering algorithms
The goal of this paper is to contribute to a deeper understanding of the Unicode Bidirectional Reference Algorithm. We have provided an alternative reference algorithm written in the functional language Haskell. The advantage ...