# Description

The sole purpose of this program is generating, and displaying, truth tables.

This free version supports all usual connectives of classical logic, that is negation, conjunction, (inclusive) disjunction, conditonal (material implication), and biconditional (material equivalence), as well as the constants 1 and 0 denoting truth and falsehood, respectively. A cool thing is that, besides the somewhat boring standard notation of logic, you may use Lukasiewicz's stream-lined, shiny Polish notation, too.

And it doesn't stop here. If you are the down-to-earth, common-sense kind of person, you will find it reassuring that, by default, the program uses classical, two-valued, logic. But if you are more of the adventurous type, never stopping short of an enterprise, you will be delighted to learn that Truth Tables for Android supports a number of non-classical, multi-valued systems of logic, too. Never enter a river twice, and two negatives don't make an affirmation, so to speak!

You must install this app before submitting a review.

Google Play reviews now use Google+ so it's easier to see opinions from people you care about. New reviews will be publicly linked to your Google+ profile. Your name on previous reviews now appears as "A Google User".

Write a review

My review

Review from

# Reviews

Helpfulness

Newest

Rating

Helpfulness

All Versions

All Versions

Latest Version

4.3

285 total

5 190

4 43

3 18

2 9

1 25

Kevin R

Very Useful This is a very good app for my math class. The only thing I can't get to work on my Galaxy S5 are the NOR and NAND functions. When I do the long hold on OR or AND, nothing happens.

Quantez C

Isn't allowing keyboard The app isn't allowing me to manually type in operators. Tried switching keyboards but still nothing. (SwiftKey to stock, then back)

User reviews

Smh This app is bullshit every time I enter the expression AB V ab' it wouldn't answer it

Erpelstolz April 23, 2013

You might consider entering a well-formed expression of propositional logic for a change. ;-) Awesome This is, wait for it......legendary! Thank you, you guys for making this

You are the best kind of person. Free, no ads, no unneeded permissions, useful and easy. I can tell this is a labor of love. Rock on!

If you like sentential logic, you'll find this app to be useful and fun.

Just plain fun, and dev fixed FC literally hours (<12) after I emailed him. Such attention alone is worth 5 stars.

# What's New

* NAND and NOR are more prominent for most screen sizes (requested by a user)

* cleaning up layouts (please report any problem with exotic devices)

* allowing "*" and "+" for conjunction and disjunction, respectively (requested by a user)

* optionally showing separator lines between main columns (requested by a user)

* on-screen keyboard optionally showing the propositional letters A, B, C,... instead of P, Q, R,... (requested by a user)

# Additional information

Updated

November 14, 2013

Size

207k

Installs

10,000 - 50,000

Current Version

3.43

Requires Android

2.2 and up

Content Rating

Everyone

Permissions

Report

Flag as inappropriate Offered By

Erpelstolz

# Similar

## FLXKarnaugh

Use this app to play around truth tables and Karnaugh maps.

This application is intended primarily to students and hobbyists of electronics

engineering, allowing you to keep a list of logic functions, entering them by

their truth-table and viewing its corresponding Karnaugh map and minimized logic

circuit.

With this application you can enter a logic function of n inputs, fill a truth table and see its corresponding Karnaugh map.

You can also edit the function from the Karnaugh map and see the minterm form of the simplified equation.

Key features:

List of multiple logic functions, ranging from 1 to 10 inputs.

Edit a function by truth-table.

Edit a function graphically over its Karnaugh Map.

See simultaneously its minimized form while editing.

View the minimized function and its circuit.

## Logic Simulator Pro

KAJORY

1

Build circuits with logic gates and several other components to simulate their functions.

With its simple and easy to use interface it doesn't take long to learn how to use it, great for students who's learning how logic circuit works.

With its simple and easy to use interface it doesn't take long to learn how to use it, great for students who's learning how logic circuit works.

Logic Simulator Pro contains several new and inproved features.

New features:

- Save circuit

- Pinch zoom

- New components (Memory cell, Display)

- Improved performance

## Morgana Boolean Calculator X

Morgana is a powerful tool to simplify arbitrarily complex Boolean expressions and equations. After entering the Boolean equation it shows you step by step the various simplification steps to the finished result! Morgana supports all standard axioms. Among the complementary laws, the distributive, the de Morgan's law, the associative laws idempotency, the neutrality laws, the extremely rule, the duality laws and the absorption law! Any or all processing steps can also be optionally turned off. Morgana help science students to check their complex equations. Furthermore electronic engineers, technicians and engineers get with Morgana an efficient tool to simplify their boolean terms.

## Karnaugh map

Karnaugh tables allow to find the logic equation of a system from its truth table. This method is detailed graphically by this educational application. It provides the different blocks and gives the logical solution.

Created with the courtasy of Thorsten Thormählen, professor at the University of Marburg, which creates the JavaScript resolution: http://www.mathematik.uni-marburg.de/~thormae/lectures/ti1/code/karnaughmap/index.html

Application of Dr. Jean-Paul Guillet from the University of Bordeaux: http://terahertz.fr

## Boolean lab

Boolean lab - a small laboratory in your mobile / tablet.

Interactive and visual explanation of the boolean variables, logic functions and their behavior. For each logic function is shown its type, truth table and gate. Everything is interactive - input variables change is immediately reflected in the truth table and on the input(s) and output(s) of gates.

You can set the display logic values either in the form of 1-0 or H-L. The width of gates can be adapted to the current device (phone / tablet).

## KMAP-Karnaugh

JPF DEV

1

KMAP is the application to learn, practice and verify the use of the method for simplifying Karnaugh maps (aka table or Karnaugh Veitch diagram). To calculate the minimum solution or expression is based on the algorithm Quine-McCluskey.

Solves systems 2 to 5 graphically variables, wherein for each of the expressions

or grouping of minterms can be graphically distinguish the target group.

NO matter Supports terms.

## Mini Karnaugh

Mini Karnaugh is a free Android tool that helps students and professionals in Computer Science minimize logical expressions.

It also helps you evaluate and visualize them in forms of Veitch-Karnaugh maps and truth tables.

Easy to use and time-saving!

Features include:

• Easy minimization from written expressions, Karnaugh maps and truth table

• Supports 'don't cares' ('X')

• Supports up to 8 variables

• After evaluation, you can easily edit the table/map to modify the expression and minimize it again

Try it now! More on http://sherbanmobile.appspot.com/

It also helps you evaluate and visualize them in forms of Veitch-Karnaugh maps and truth tables.

Easy to use and time-saving!

Features include:

• Easy minimization from written expressions, Karnaugh maps and truth table

• Supports 'don't cares' ('X')

• Supports up to 8 variables

• After evaluation, you can easily edit the table/map to modify the expression and minimize it again

Try it now! More on http://sherbanmobile.appspot.com/

## Digital Logic

The aim of this application is to provide basic idea about Digital Logic Design or Digital Electronics or Digital. It contains description about Number Systems, Circuit Minimization, Logic Gates, Sequential circuits, Combinational circuits and Logic Families.

It contains details for those who want to learn digital systems in simple way.

It is a basic application which can cover most of concepts.

It contains details for those who want to learn digital systems in simple way.

It is a basic application which can cover most of concepts.

## LogicCalc

LogicCalc is a calculator for solving problems in the propositional calculus (symbolic logic). It is useful for those taking an introductory logic course or those who are trying to learn symbolic logic on their own.

LogicCalc supports all 19 rules of inference including the 10 rules of replacement. It is smart enough to allow you to select parts of a proposition to perform a replacement on instead of just an entire WFF.

Workbooks of logic problems may be created offline and loaded into LogicCalc, the problems worked on and the results saved back to files for future reference.

As this is an early version of this application if you have any problems or crashes please contact me at "support@elsoftonline.net". I will get back to you and look into any problem.

This version of LogicCalc only supports the propositional calculus. A future version is in the works that will support the predicate calculus as well.

This application is ad-supported. If enough interest is shown a "Professional" version can be made that is ad-free.

## Logic Calculator

Kemick

1

Logic Calculator takes sentential boolean expressions and applies a single function: simplification. The simplification algorithm is essentially Quine-McClusky, and should produce optimal expressions.

Simplification can be used to test for tautologies/contradictions and, by extension, for validity and equality.

• Tautologies are evaluated to True (they are true in all cases)

• Contradictions are evaluated to False (they are false in all cases)

• Contingent expressions are reduced to a sum of products form. (i.e. the cases in which it is true).

• Sum of products is a disjunction of conjunctions.

(e.g. (A | (B & C) | (D & E))).

Usage Examples:

Testing Argument Validity:

"((P -> Q) & P) -> Q" (Modus Ponens) evalutes to True.

"((A|B) -> B)" is not a valid argument and will reduce only to the conditions where it is true (~A or B). If you want counter-examples to demonstrate invalidity, pretend it is a contradiction and negate the expression. Both "~(~A | B)" and "~((A|B) -> B)" reduce to (A and ~B). If A is true and B is false, then neither A nor B can imply B.

Testing Expression Equality:

"(A | B) & ( A | C) = (A | (B & C))" distribution example evaluates to true.

(A = B) reduces to the two cases in which the expression is true (A&B | ~A&~B). Negate for counterexamples to equality (~A&B | A&~B).

Simplify an Expression:

"(A & (~A | (B & B)))|((A & B) & ~(A & B))" will reduce to "A & B"

Notes:

10 variables are provided and should work in most cases (though larger expressions may be a bit slow). Expressions can be written elsewhere and pasted into the input text field. The parser will attempt to process up to 24 variables (A-Z minus T/F). As the computational and memory costs are exponentially related to the variable count, using many variables may cause a crash from lack of memory (or it may simply spin for an indefinite period of time). I've included this option just in case someone finds it useful, but don't be surprised if it crashes the program.

If the program crashes on seemingly reasonable input or, even worse, if the program produces incorrect output for a given input (i.e. non-equivalent or non-optimal output), please shoot me an email with an expression that produces such incorrect behavior. For crashes, you should also be able to submit the exception from the error dialog (though I'll have no idea what input was being operated on, so send that as well in an email).

## Digital Logic Gate

Vishal H

1

This Application shows information about Digital Logic Gate with Truth Table.It Shows Information of AND gate,OR gate,NOT gate,EX-OR gate and EX-NOR gate with truth tables.When User enters two inputs and click on show output then it shows output.When User click on Back then it goes to previous screen.

## Discrete Mathematics

This ultimate unique application is for all students across the world. It covers 113 topics of Discrete Mathematics in detail. These 113 topics are divided in 5 units.

Each topic is around 600 words and is complete with diagrams, equations and other forms of graphical representations along with simple text explaining the concept in detail.

This USP of this application is "ultra-portability". Students can access the content on-the-go from anywhere they like.

Basically, each topic is like a detailed flash card and will make the lives of students simpler and easier.

Some of topics Covered in this application are:

1. Set Theory

2. Decimal number System

3. Binary Number System

4. Octal Number System

5. Hexadecimal Number System

6. Binary Arithmetic

7. Sets and Membership

8. Subsets

9. Introduction to Logical Operations

10. Logical Operations and Logical Connectivity

11. Logical Equivalence

12. Logical Implications

13. Normal Forms and Truth Table

14. Normal Form of a well formed formula

15. Principle Disjunctive Normal Form

16. Principal Conjunctive Normal form

17. Predicates and Quantifiers

18. Theory of inference for the Predicate Calculus

19. Mathematical Induction

20. Diagrammatic Representation of Sets

21. The Algebra of Sets

22. The Computer Representation of Sets

23. Relations

24. Representation of Relations

25. Introduction to Partial Order Relations

26. Diagrammatic Representation of Partial Order Relations and Posets

27. Maximal, Minimal Elements and Lattices

28. Recurrence Relation

29. Formulation of Recurrence Relation

30. Method of Solving Recurrence Relation

31. Method for solving linear homogeneous recurrence relations with constant coefficients:

32. Functions

33. Introduction to Graphs

34. Directed Graph

35. Graph Models

36. Graph Terminology

37. Some Special Simple Graphs

38. Bipartite Graphs

39. Bipartite Graphs and Matchings

40. Applications of Graphs

41. Original and Sub Graphs

42. Representing Graphs

43. Adjacency Matrices

44. Incidence Matrices

45. Isomorphism of Graphs

46. Paths in the Graphs

47. Connectedness in Undirected Graphs

48. Connectivity of Graphs

49. Paths and Isomorphism

50. Euler Paths and Circuits

51. Hamilton Paths and Circuits

52. Shortest-Path Problems

53. A Shortest-Path Algorithm (Dijkstra Algorithm.)

54. The Traveling Salesperson Problem

55. Introduction to Planer Graphs

56. Graph Coloring

57. Applications of Graph Colorings

58. Introduction to Trees

59. Rooted Trees

60. Trees as Models

61. Properties of Trees

62. Applications of Trees

63. Decision Trees

64. Prefix Codes

65. Huffman Coding

66. Game Trees

67. Tree Traversal

68. Boolean Algebra

69. Identities of Boolean Algebra

70. Duality

71. The Abstract Definition of a Boolean Algebra

72. Representing Boolean Functions

73. Logic Gates

74. Minimization of Circuits

75. Karnaugh Maps

76. Dont Care Conditions

77. The Quine MCCluskey Method

78. Introduction to Lattices

79. The Transitive Closure of a Relation

80. Cartesian Product of Lattices

81. Properties of Lattices

82. Lattices as Algebraic System

83. Partial Order Relations on a Lattice

84. Least Upper Bounds and Latest Lower Bounds in a Lattice

85. Sublattices

86. Lattice Isomorphism

87. Bounded, Complemented and Distributive Lattices

88. Propositional Logic

89. Conditional Statements

90. Truth Tables of Compound Propositions

91. Precedence of Logical Operators and Logic and Bit Operations

92. Applications of Propositional Logic

93. Propositional Satisfiability

94. Quantifiers

95. Nested Quantifiers

96. Translating from Nested Quantifiers into English

97. Inference

98. Rules of Inference for Propositional Logic

99. Using Rules of Inference to Build Arguments

100. Resolution and Fallacies

101. Rules of Inference for Quantified Statements

102. Introduction to Algebra

103. Rings

104. Properties of rings

105. Subrings

106. Homomorphisms and quotient rings

107. Groups

108. Properties of groups

109. Subgroups

All topics not listed due to character limitations set by Google Play.