Truth Tables for Symbian

Android migration

Nokia has announced to phase out its Symbian operating system. For this reason, I have re-written the Truth Tables Program for my new favourite, Android. The Android Truth Tables program is not a simple port, but a completely new application, offering much more features than its Symbian counterpart, most notably support for several systems of non-classic logic, and, optionally, showing intermediate results, too.

The program

The sole purpose of this program is generating, and displaying, truth tables under Symbian. It will work with a number of fairly recent Nokia mobile phones, especially (but not restricted to) those with a touch-pad. Trying out the program on a Symbian phone of your choice won't do any harm; if it proves not to work with the respective phone, just uninstall it, and, optionally, hope for a future version.

The program supports all usual connectives of classical logic, that is negation, conjunction, (inclusive) disjunction, conditional (material implication), biconditional (material equivalence), exclusive disjuncton (XOR), the Peirce operator (NOR), the Sheffer operator (NAND), as well as the constants 1 and 0 denoting truth and falsehood, respectively.

Download

Free (but light) trial version

For purposes of testing the program (and for solving simple tasks), there is a free light version restricted to propositions containing only the two propositional constants P, and Q. This suffices for solving several kinds of homework. The full version, completely devoid of this restriction, costs less than one Euro, anyway.

Download free version

Compatibility

The program has been tested running e.g. on the following Nokia devices: 5230, 5630 XpressMusic, 5800 XpressMusic, 6220 classic, 6700, 6710 Navigator, E51, E52, E63, N86, N97, N97 mini, X6

The following Nokia devices are known to run this program with the single exception that they do not show the "Input" and "Examples" menus, meaning that you have to enter your propositions using the keyboard: N78, N81, N96

The following Nokia devices are known not to run this program: 5700, 6110, 6120 classic, E61, N73, N80, N93

Input examples

Usage

The main component of the user interface is the text field where the user may enter a single proposition, be it in infix notation (the somewhat standard way of writing down propositions), or in Polish notation (the cool prefix notation developed by Lukasiewicz in the 1920s).

• When using a device with a full keyboard, you will probably enter the proposition using the keyboard.
• On a touch-style device, you will usually make use of the visual buttons labelled "P", "Q", and so on. There are buttons for a few propositional letters, and for the most important connectives. The blue button labelled "C" is for deleting the most recently entered character. The green button, finally, will submit your proposition causing the truth table to be generated.
• When using a device with a typical phone keyboard, you probably will prefer entering your proposition by selecting the respective entries in the options menu. The menu item "Propositions" will allow you to choose a propositional letter. The item "Connectives" offers a list of available connectives. The item "Brackets" will allow you to enter a bracket.

When finished entering, a truth table will be generated from the proposition when you either select the green touch-button (mentioned above), or when you select the respective item from the "Options" menu.

Infix notation

Note: Your browser may be unable to properly display some of the logical connectives used below. Of course this restriction will not apply to the program when installed and running on your personal computing device.

Propositional constants

A through U, and W through Z, case insensitive; note that the letter "v" is reserved for disjunction (see below) and may not be used for a propositional constant.

Negation

~ (tilde), - (dash), ¬

Conjunction

& (ampersand), ^, ∧

Disjunction

v (the lower-case letter), |, ∨

Conditional

>, ->, =>, -->, ==>, →

Biconditional

=, ↔

XOR

%

Peirce operator (NOR)

! (exclamation mark), ↓

Sheffer operator (NAND)

upside-down exlamation mark, ↑

Brackets

As usual, the rounded brackets, (, and ), may be used for grouping expressions.

Spaces

In order to improve readability, the user may freely add space characters into their proposition.

Polish Notation

Propositions in Polish notation are restricted to Lukasiewicz's own connectives N, K, A, C, and E. You have to user lower-case letters as propositional constants, but not the letter "v", since it denotes infix disjunction (see above). If you want to use connectives other than Lukasiewicz's, you can easily build them up from Lukasiewicz's, by e.g. using NA for the Peirce function (NOR), NK for the Sheffer function (NAND), or NE for the exclusive disjunction (XOR).

Feedback

Your feedback, questions, and support will be most welcome. Please direct your verbal feedback to gottschall@gmx.de.

2012-09-07 09:58:02
gottschall@gmx.de