ArticleslgStudy

mathematics

Logical machine

Logical machine is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Logical machine rather than just read about it. In short: A logical machine or logical abacus is a tool containing a set of parts that uses energy to perform formal logic operations through the use of truth tables. Early logical machines were mechanical devices that performed basic operations in Boolean logic.

Logical machine — main illustration
Logical machine — illustration

Key takeaways

  • Logical machine belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Logical machine to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Logical machine from memory before moving on to harder problems.

Reference excerpt

A logical machine or logical abacus is a tool containing a set of parts that uses energy to perform formal logic operations through the use of truth tables. Early logical machines were mechanical devices that performed basic operations in Boolean logic. The principal examples of such machines are those of William Stanley Jevons (logic piano), John Venn, and Allan Marquand. Contemporary logical machines are computer-based electronic programs that perform proof assistance with theorems in mathematical logic. In the 21st century, these proof assistant programs have given birth to a new field of study called mathematical knowledge management.

Origins The earliest logical machines were mechanical constructs built in the late 19th century. William Stanley Jevons invented the first logical machine in 1869, the logic piano. In 1883, Allan Marquand invented a new logical machine that performed the same operations as Jevons' logic piano but with improvements in design simplification, portability, and input-output controls. A logical abacus is constructed to show all the possible combinations of a set of logical terms with their negatives, and, further, the way in which these combinations are affected by the addition of attributes or other limiting words, i.e., to simplify mechanically the solution of logical problems. These instruments are all more or less elaborate developments of the "logical slate", on which were written in vertical columns all the combinations of symbols or letters which could be made logically out of a definite number of terms. These were compared with any given premises, and those which were incompatible were crossed off. In the abacus the combinations are inscribed each on a single slip of wood or similar substance, which is moved by a key; incompatible combinations can thus be mechanically removed at will, in accordance with any given series of premises.

See also

Logics for computability Stanhope Demonstrator

References

Bibliography This article incorporates text from a publication now in the public domain: Chisholm, Hugh, ed. (1911). "Abacus". Encyclopædia Britannica. Vol. 1 (11th ed.). Cambridge University Press. pp. 5–6.

Bennett, Deborah (2005). Logic Made Easy: How to Know When Language Deceives You. W. W. Norton & Company. p. 163. ISBN 0393326926. Allan Marquand logic machine. Marquand, Allan (1883), "A Machine for Producing Syllogistic Variation" in C. S. Peirce, ed., Studies in Logic, pp. 12–15, along with "Note on an Eight-Term Logical Machine", p. 16. Google Books Eprint. Book reprinted 1983 with introduction by Max Fisch. (1886), "A New Logical Machine", Proceedings of the American Academy of Arts and Sciences 21: 303–07. Google Books Eprint. Peirce, C. S. (1886 letter), Letter, Peirce to A. Marquand, 1886 December 30, published 1993 in Kloesel, C. et al., eds., Writings of Charles S. Peirce: A Chronological Edition, Vol. 5. Indiana Univ. Press, pp. 421–3. Google Books Preview. (1887), "Logical Machines", The American Journal of Psychology v. 1, n. 1, Baltimore: N. Murray, pp. 165–70. Google Books Eprint. Reprinted in (1976) The New Elements of Mathematics v. III, pt. 1, pp. 625–32; (1997) Modern Logic 7:71–77, Project Euclid Eprint; and (2000) Writings of Charles S. Peirce v. 6, pp. 65–73. Baldwin, Mark James (1902), "Logical Machine", Dictionary of Philosophy and Psychology, pp. 28–30 Google Books Eprint. Classics in the History of Psychology Eprint. Ketner, Kenneth Laine (1984), "The early history of computer design: Charles Sanders Peirce and Marquand's logical machines", with the assistance of Arthur Franklin Stewart, Princeton University Library Chronicle, v. 45, n. 3, pp. 186–211. PULC 15MB PDF Eprint. Dalakov, Georgi (undated), "Charles Peirce and Allan Marquand", History of Computers and Computing. Eprint.

Further reading Jevons, William Stanley (1869). The substitution of similars, the true principle of reasoning, derived from a modification of Aristotle's dictum. London: MacMillan – via Internet Archive. — On p.55f, Jevons gives a description of his logical abacus.

Illustrations

Logical machine: Jevons' Logic Piano in the Sydney Powerhouse Museum in 2006
Jevons' Logic Piano in the Sydney Powerhouse Museum in 2006

Worked examples

Example 1 — a first encounter with Logical machine

Start with the simplest possible case. Write down what Logical machine claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Logical machine before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Logical machine ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Logical machine

In research
Logical machine appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Logical machine in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Logical machine is common in secondary-school and first-year university syllabi. It links to neighbouring topics Mathematical logic, Mathematical logic stubs, so understanding it makes those chapters shorter.
In everyday life
Look for Logical machine outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Logical machine in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Logical machine means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Logical machine out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Logical machine in simple terms?

A logical machine or logical abacus is a tool containing a set of parts that uses energy to perform formal logic operations through the use of truth tables. Early logical machines were mechanical devices that performed basic operations in Boolean logic.

Why does Logical machine matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Logical machine?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Logical machine.

Tags

  • Mathematical logic
  • Mathematical logic stubs

Keep exploring